Product
Patsnap Eureka
For R&D, Patsnap Eureka makes reading and utilizing patents & technical documents easy.
Patsnap Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Patsnap Eureka Materials
Designed for material experts only. Revolutionize your material R&D, from search, analyze, to developing new materials.
Feature
TechResearch
Generate reliable direction feasibility study reports for your R&D in just a few steps.
TechSeek
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
TechMind
As an expert in R&D Theories, TechMind can generates customized viable solutions instantly.
TechRisk
Analyze your overall solution with one click, know your potential R&D risks in advance.
TechMonitor
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
77 results about "Delaunay triangle" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
A Delaunay triangulation is a particular way of joining a set of points to make a triangular mesh. Delaunay triangulations tend to avoid skinny triangles. The triangulation was invented by Boris Delaunay in 1934.
Method for generating tetrahedron gridding for three-dimensional geological structure
ActiveCN102194253AImprove efficiencySatisfy demands such as incremental modeling3D modellingStructured modelTypes of mesh
The invention discloses a method for generating a tetrahedron gridding for a three-dimensional geological structure, which is used for geologic body attribute modeling and oil-deposit numerical simulation computation and analysis. The invention is characterized in that an automatic reliable recovering method for geologic restrained boundary segments and layering gridding is supplied and the tetrahedron gridding under the restraining of inputting a three-dimensional geological structured model is generated, on the basis of a standardized settling for inputting a three-dimensional geological surface gridding model and the Delaunay triangulation gridding generating method based on a point set, and by utilizing a topologic principle and detecting constraint conditions and crossing conditions of the elements such as edges, sides and bodies in an antithetical Voronoi diagram of a Delaunay tetrahedron gridding as well as establishing a corresponding point adding rule. The method is easily realized, has high reliability and has no specific demand on complexity of an initial surface model and the classification of the gridding. By using the method, the problem of gridding the tetrahedron under a complex geological structure is solved, thereby being convenient to perform further analysis and simulation computation on the three-dimensional geological model on such a basis.
Owner:北京网格天地软件技术股份有限公司
GNSS network differential positioning reference station network construction method and dynamic updating method
InactiveCN101498785AGuaranteed accuracy requirementsLighten the computational burdenPosition fixationNetwork constructionDiscrete points
The invention discloses a constructing method and a dynamically updating method of a GNSS network difference positioning reference station network. In the method, each GNSS reference station is projected to a two-dimensional plane according to the known and accurate coordinates of the GNSS reference station; a reference station network taking a triangle as a basic structure is formed by the discrete points of the two-dimensional plane according to the network constructing rule of a Delaunay triangle network, and the shape of the network is unique. When a new reference station is increased or a certain reference station is not used, the real-time construction of a new network is finished through operation of point insertion or point deletion. The invention can keep the unique optimized network shape of the reference stations and meet the precision requirement when a movable station is positioned.
Owner:SOUTHEAST UNIV
Drawing comparison apparatus
InactiveUS7106330B2High precision and reliabilityImprove accuracyDrawing from basic elementsData processing applicationsSpatial correlationAttribute grammar
Owner:FUJITSU LTD
High-resolution remote sensing image registration method with control points distributed in adaptive manner
InactiveCN104361590AAccurate extractionImprove registration accuracyImage enhancementImage analysisNormalized mutual informationContourlet
The invention discloses a high-resolution remote sensing image registration method with control points distributed in an adaptive manner. By the use of the high-resolution remote sensing image registration method, a multi-scale J-image is introduced into image registration. A self-adaptive control points extracting method based on a partitioning strategy is provided to extract the control points of the multi-scale J-image image, thus the defect that the control points only sense specific directional high-frequency information is overcome. A self-adaptive control points extracting strategy is defined so as to limit control point distribution. The control points are subjected to multi-scale matching by NMI (normalized mutual information measure), allowing registration function smooth. Geometric correction is realized by adopting Delaunay triangle local transformation. In the following text, basic principle and key steps of the algorithm are introduced, and three remote-sensing image groups of different types are subjected to experiment and analysis and comparison experiments with various registration methods based on wavelet transform and NSCT (non-subsampled contourlet transform).
Owner:HOHAI UNIV
Method for filling isoline of petroleum seismotectonic map
InactiveCN101738638AHigh speedHigh precisionSeismic signal processingSeismology for water-loggingCoverage TypeLine segment intersection
The invention discloses a method for filling an isoline of a petroleum seismotectonic map, wherein the isoline of the petroleum seismotectonic map is built by using cross-sectional data after analysis and interpretation of seism and by using a triangulated irregular network. The method comprises the following steps: creating the isoline of the petroleum seismotectonic map by a common method of generating the isoline by using grids, building the triangulated irregular network by the Delaunay triangle principle, extracting a skeleton line, traversing a triangle by taking a line segment between every two points on the isoline as a restriction, extracting and deleting all the triangles intersecting with the line segment, locally rebuilding the triangulated network, and directly filling each triangle at equal intervals or gradually to generate the seismotectonic map. The method can fill an area between two optional isolines by filling each triangle, and has the advantages of high speed and precision when compared with the traditional coverage type filling method.
Owner:BGP OF CHINA NAT GASOLINEEUM CORP
WSN coverage blind zone detection method based on three-dimensional terrain correction
The invention discloses a WSN coverage blind zone detection method based on three-dimensional terrain correction. The WSN coverage blind zone detection method comprises the steps of: deploying sensor nodes in a target region randomly, and carrying out Delaunay triangular subdivision; drawing a circumcircle of each Delaunay triangle, and showing boundary of a coverage blind zone through adopting a minimum polygon capable of containing the coverage blind zone; judging false boundary nodes among the boundary nodes, and showing the improved coverage blind zone boundary through adopting a minimum polygon capable of containing the coverage blind zone again after removing the false boundary nodes; and calculating an actual detection radius by utilizing a slope and a slope aspect angle, and finally calculating the corrected coverage blind zone boundary by using a detection algorithm. The WSN coverage blind zone detection method has the beneficial effects that the detection algorithm of the coverage blind zone can be applied to terrain surface with large fluctuation.
Owner:GUILIN UNIVERSITY OF TECHNOLOGY
Delaunay triangulation network parallel net-constructing method based on rectangular piecing towards magnanimity point cloud data
InactiveCN103092933AImprove network construction efficiencyReduce exceptionsSpecial data processing applicationsPoint cloudAngular point
The invention relates to a Delaunay triangulation network parallel net-constructing method based on rectangular piecing towards magnanimity point cloud data. The method includes that firstly, a rectangular partition is carried out for planar space and a plurality of rectangular regions which are mutually put together are obtained. All points which fall in the same rectangular region are regarded as a sub point set of the rectangular region. An angular point is plugged into a position of the divided rectangular vertex and the vertex is added into a sub point set of the neighboring rectangular region. Secondly, a Delaunay triangulation sub-network is built over the sub point sets in which angular points are added. Thirdly, four angular points of the sub point set in each rectangular region are utilized for splicing all Delaunay triangulation sub-networks and a Delaunay triangulation network of the whole planar space is available. Fourthly, angular points which are added in the first step and the Delaunay triangles which are related with the angular points are deleted from the Delaunay triangulation network. Fifthly, the Delaunay triangulation network is carried out optimization so that the construction of the Delaunay triangulation network of the planar space is completed. The method has the advantages that the splicing process of the Delaunay triangulation sub-network is simplified and the efficiency of building the Delaunay triangulation network is improved.
Owner:NANJING UNIV
Wireless sensor network positioning optimization method under field condition
InactiveCN104363650AHigh precision coverageAdvantages of Positioning AccuracyNetwork topologiesLocation information based serviceMobile wireless sensor networkWireless mesh network
The invention discloses a wireless sensor network positioning optimization method under a field condition. The method includes: performing finite element division on a target area, calculating the area of the area which can be positioned, sequentially performing Thiessen polygon division and Delaunay triangulation subdivision on a sensor network to obtain the gravity center of each Delaunay triangle and sorting, deploying newly-added sensor nodes to the gravity center of the largest Delaunay triangle, judging whether network coverage meets the requirements or not, and if not, repeating the steps. The method has the advantages that the requirement of the to-be-positioned area is quite low, no other equipment except for the nodes needs to be arranged, and positioning targets do not need to wear any labels; manpower requirements of the to-be-positioned area is quite low, frequent maintenance by people is not needed, and the deployed equipment can be used for a long time without artificial intervention; the to-be-positioned area can be any field environments, and the requirements of large field cultural heritage protection and wild animal protection are satisfied.
Owner:NORTHWEST UNIV
Stereo dense matching method and system
The invention discloses a stereo dense matching method, which comprises the following steps of extracting feature points of a left image and a right image and determining support points through carrying out feature point matching on the feature points; constructing a Delaunay triangle according to the support points, wherein the Delaunay triangle comprises a prior probability of disparities of all pixel points in the triangle and a minimum support distance between the pixel points and the support points; utilizing a disparity computation method to compute a disparity conditional probability and a disparity confidence level of the pixel points in the left picture; and utilizing a Bayes principle to compute an optimal posterior disparity according to the Delaunay triangle, the disparity conditional probability and the disparity confidence level. According to the method, a high-precision disparity image is obtained through rapid matching, and the method is especially suitable for a mobile platform or the application field with high real-time requirements; the invention also discloses a stereo dense matching system, which has the beneficial effects.
Owner:CHENGDU TOPPLUSVISION TECH CO LTD
Complex geological structure modeling method based on sparse point cloud curved surface reconstruction
The invention discloses a complex geological structure modeling method based on sparse point cloud curved surface reconstruction, for solving the problem of multiple values of a geological horizon in a reverse geological structure in some areas, which cannot be solved by use of a conventional grid method. The idea of a projection plane is brought forward, i.e., original seed point data is vertically projected to a certain plane, Delaunay triangle network connection is performed on the plane, then a space triangle network is recovered through a one-to-one corresponding relation between seed points and projection points, reconstruction of a complex geological curved surface is completed in such a way, selection of the projection plane is converted into an optimization mathematic model, then the optimization mathematic model is converted to a convex optimization problem, and rapid solving is performed.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA
Method for constructing triangle gridding as well as application thereof for geotechnical engineer modeling
InactiveCN101303770ASimple structureFast construction2D-image generation3D modellingDiscrete pointsComputer science
Owner:SUN YAT SEN UNIV
Drawing comparison apparatus
InactiveUS20050179694A1High precisionImprove reliabilityImage analysisDigital data information retrievalSpatial correlationData mining
After thinning an input image (drawing), a primitive is extracted. First, a rough primitive is extracted, and then the rough primitive becomes a primitive in a merge-split process according to a greedy strategy. Based on the primitive and the spatial correlation among primitives, an attribute graph describing the contents and the structure of the drawing is generated. The attribute graph is generated using a modified Delaunay triangle and an attribute set. An attribute graph having an attribute set is generated for each of an inquiry drawing and a comparison drawing which are compared with each other, thereby perform drawing comparison.
Owner:FUJITSU LTD
Medial Axis Extraction for Complex 3D Objects
A novel methodology for computing the medial axis / skeleton of a discrete binary object using a ‘divide and conquer’ algorithm, in which any 3D object is first sliced into a series of 2D images in X, Y and Z directions. Then, a geometric (Voronoi) algorithm is applied on each 2D image to extract the respective medial axis. This information is then combined to reconstruct the medial axis of the original 3D object using an intersection technique. An optional 3D interpolation step to achieve continuous connected skeletons uses Delaunay triangles and a spherical search to establish the nearest neighboring points in 3D space to interpolate between. Test results show that the proposed 3D Voronoi and optional interpolation algorithms are able to accurately and efficiently extract medial axes for complex 3D objects as well. Finally, an axis-smoothing algorithm using the same Delaunay triangle and spherical test is operable to remove unwanted noise from the extracted medial axis.
Owner:UNIVERSITY OF MANITOBA
Outline thickness adjusting method and device of TrueType font
ActiveCN105513006AImprove the efficiency of contour thickness adjustmentShorten the design cycleGeometric image transformationDiscretizationComputer science
The invention provides an outline thickness adjusting method and a device of a TrueType font. The method comprises steps of reading outline data of the to-be-adjusted TrueType font; carrying out discretization processing on the outline data so as to obtain discretized outline data; carrying out Delaunay triangle division procession on outline of the discretized TrueType font; extracting framework lines of the TrueType font after the Delaunay triangle division processing; determining corresponding points on corresponding framework lines of all points on outline of the to-be-adjusted TrueType font; selecting corresponding new outline points of the points on connection lines of the points and the corresponding points according to adjustment types; using the outline formed via connection of the corresponding outline points of the points as the outline of the adjusted TrueType font. According to the invention, adjustment efficiency of outline thickness of the TrueType font is increased.
Owner:BEIJING HANYI KEYIN INFORMATION TECH
3Dflyover modeling method based on Reeb graphs
ActiveCN106920278AEnrich and improve road informationAccurate description3D modellingModel method3d image
The invention discloses a 3Dflyover modeling method based on Reeb graphs. The method includes the following steps: 1. acquiring a discrete coordinate of the 3D image of any flyover; 2. extracting structures of the flyover that mutually cover each other and projecting the structures; 3. determining the boundaries of the scatter points of the projection; 4. carrying out Delaunay triangle division; 5. generating a Reeb graph on the basis of a triangular mesh; 6. determining key points of the Reeb graph, and dividing the Reeb graph; and 7. filling the Reeb graph and knitting the scatter points. According to the invention, the method can achieve 3D modeling of complex road sections of the flyover in an electronic map, such that information of all kinds of complex road sections efficiently represented in the electronic map, and a navigation system can be linked to the electronic map, road information of the current electronic map is further enriched and improved, and more accurate information is provided for the user.
Owner:HEFEI UNIV OF TECH
Generating system and method for high-precision three-dimensional navigation map of fully mechanized mining face
ActiveCN110118550APrecise positioningInformation perceptionUnderground miningTesting machinesSeismometerGround-penetrating radar
Owner:CHINA UNIV OF MINING & TECH
Three-dimensional fluorescence spectrum feature extraction method based on two-dimensional Gabor wavelet
InactiveCN109472287AEasy to identifyImprove accuracyCharacter and pattern recognitionRayleigh scatteringGraph spectra
The invention discloses a three-dimensional fluorescence spectrum feature extraction method based on two-dimensional Gabor wavelet. Comprises the following steps: S1, acquiring original three-dimensional fluorescence spectrum data; S2. Removing the Rayleigh scattering in the original spectrum by Delaunay triangle interpolation; S3. Removing the Raman scattering in the original spectrum by subtracting the blank background solvent; S4. Using multidimensional S-G smoothing for spectral denoising; S5. Convolutional filtering is performed on Two-dimensional Gabor wavelet functions generated by different scales of expansion and contraction and rotation and three-dimensional fluorescence spectra after pretreatment of S1-S4 obtain different Gabor coefficient characteristic matrices. S6. Reducing the characteristic dimension of the Gabor coefficient characteristic matrix obtained from S5 by using the method of block statistics; S7. The different characteristic matrices obtained by the method instep S6 are recombined to obtain the final characteristic matrices of the three-dimensional fluorescence spectrum. The method improves the efficiency of extracting texture information from 3D fluorescence spectra and lays a foundation for water quality monitoring based on 3D fluorescence spectra.
Owner:ZHEJIANG UNIV
Method for extraction of arterial traffic through adoption of open street map
The present invention discloses a method for extraction of arterial traffic through adoption of an open street map. The method comprises the following steps of: the step 1, obtaining original road line data in an open street map, performing pre-processing, organizing the original road line data to a road node and road segmental arc data structure, and performing interpolation encryption of the road line after pre-processing; the step 2, constructing a constraint Delaunay triangulation network for the encrypted road line, employing features of the side length of the Delaunay triangle and a skeleton portion Voronoi map unit area difference to calculate an arterial traffic identification index, and constructing an arterial traffic polygon identification model; and the step 3, utilizing the arterial traffic polygon identification model to perform Delaunay triangle classification, and employing the Delaunay triangulation network and a seed point region growing algorithm to extract the arterial traffic polygon of the open street map. The method can rapidly and reliably extract the arterial traffic from the open road data set so as to reduce the cost of city arterial traffic information extraction, and the extraction method is simple and easy to implement.
Owner:WUHAN UNIV
Balanced semi-dense stereo matching method
ActiveCN107122782AImprove matching efficiencyHigh precisionCharacter and pattern recognitionParallaxStereo matching
The present invention belongs to the computer vision technical field and discloses a balanced semi-dense stereo matching method. The invention aims to improve matching efficiency while achieving higher image matching accuracy. The method includes the following steps that: a, two images to be matched are segmented; b, pre-feature extraction initialization setting is performed; c, points of interest are extracted from image blocks: in the extraction process, a feature extraction threshold value is adaptively adjusted, merged image blocks are selected according to needs, and points of interest evenly distributed in the images are obtained; e, interest of points in the two images are matched; e, a Delaunay triangle is constructed according to the matched interest of points; and d, the parallax of all the other non interest of points is estimated according to the Delaunay triangle, and thus image stereo matching is completed. The method of the invention is particularly suitable for image matching in a mobile platform or application fields having high real-time requirements.
Owner:CHENGDU TOPPLUSVISION TECH CO LTD
Drawing comparison apparatus and method
Owner:FUJITSU LTD
Light mask and diffuse-reflecting board
PURPOSE: Provided are a photomask capable of producing a diffusion reflector with high reflective luminance without generating interference fringe or speckle, a diffusion reflector, and a color filter. CONSTITUTION: The photomask has a pattern area constituted by repetitively arranging a rectangular, parallelogrammic or hexagonal unit area where center points of a plurality of isolated patterns are arranged. The total area of a plurality of Delaunay triangles constituted by the center points in the unit area and a plurality of Delaunay triangles constituted by crossing over the boundary line of the other unit area adjacent to the unit area satisfies the following conditions: A is not less than 70 micrometer¬2 and not more than 120 micrometer¬2, and B / A is not less than 0.05 and not more than 0.25, wherein A is an average value of the Delaunay triangles having the same unit area, and B is a standard deviation thereof.
Owner:SUMITOMO CHEM CO LTD
Meteorological element interpolation assessment method based on Delaunay triangle network
The invention provides a meteorological element interpolation assessment method based on a Delaunay triangle network. The method is characterized by carrying out specific rule sampling or random sampling on meteorological element data of an area observation station, establishing the Delaunay triangle network of meteorological elements by utilizing a two-dimensional convex hull parallel algorithm, carrying out Delaunay triangle network variable resolution spatial interpolation on the meteorological element data to obtain meteorological element spatial distribution, and carrying out approximate reverse on the meteorological elements in spatial and temporal distribution to obtain meteorological element data in the regional scale. The method in the invention, based on the conventional meteorological element interpolation method, according to the practical application requirements that the spatial interpolation can keep the original observation data to be unchanged and balanced between the efficiency and accuracy, enables the deviation and smoothness of the whole grid to be controlled within a certain threshold range, and thus more accurate meteorological element data can be obtained.
Owner:NANJING UNIV OF INFORMATION SCI & TECH
Outline extracting apparatus and method
InactiveCN101464953AExtraction is automatic and accurateAccurate extractionCharacter and pattern recognitionMetal working apparatusExtraction methodsObject contour
The invention provides a contour extraction device and a contour extraction method comprising: shooting an object image, performing binarization through a filtering, extracting contour points, performing a Delaunay division to the image using the contour points as vertices, appointing the object interior points, searching from the appointed points to a Delaunay triangle edge, if getting to an edge more than a set length then keeping on searching over the edge, if getting to an edge shorter than the set length, then stopping the search of over the edge, and connecting the edges shorter than the set length as the object contour.
Owner:SHIMA SEIKI MFG LTD
Rapid base station irradiation range calculation and updating method
InactiveCN107798182AImprove computing efficiencyImprove update efficiencyDesign optimisation/simulationLocation information based serviceMinimum bounding rectangleIrradiation
The invention discloses a rapid base station irradiation range calculation and updating method. The method comprises the following steps of: (1) calculating and updating a Delaunay triangulation network by taking an initial triangle as basis; (2) calculating and updating a grid index and a topological relationship of a Delaunay triangle; (3) calculating and updating a Voronoi graph on the basis ofthe Delaunay triangulation network and the Voronoi graph; (4) calculating and updating a theoretical irradiation range of a base station by combining the Voronoi graph and an irradiation direction ofthe base station; and (5) clipping the theoretical irradiation range of the base station according to a minimum external rectangle which comprises the base station. The method has the beneficial effects that through an algorithm of constructing the grid index and the topological relationship and improving the Voronoi graph, the Voronoi graph calculation and updating efficiency is enhanced, so that the rapid calculation and updating of the theoretical irradiation range of the base station is realized, the way of positioning login users on the base station via the theoretical irradiation rangeof the base station is beneficially supported, and assistance is brought to position the login users on the base station more correctly.
Owner:JIANGSU JINLING TECH GRP CORP
Fast iterative computation method for semi-dense stereo matching
ActiveCN107730543AParallax estimation is accurateImprove matching accuracyImage enhancementImage analysisParallaxStereo matching
The invention relates to the field of computer vision technologies, and discloses a fast iterative computation method for semi-dense stereo matching, which accelerates the matching speed while satisfying the requirement of acquiring high matching precision. The fast iterative computation method can be summarized in the steps of: extracting feature points of a left image and a right image separately, and constructing feature descriptors; then, completing feature point matching of the left and right images according to the feature descriptors and an epipolar constraint, wherein the successfullymatched feature points are called supporting points; further, constructing a Delaunay triangle according to the supporting points in the left image and estimating prior parallaxes d of all pixel points in the left image; and calculating cost errors C corresponding to the prior parallaxes d, and acquiring the minimum cost error C<min> of all the supporting points during current iteration;iteratively updating a supporting point set and the minimum cost error until an iteration termination condition is satisfied; and finally, calculating a matching point in the right image of each pixelpoint in the left image according to the parallax of the pixel point.
Owner:CHENGDU TOPPLUSVISION TECH CO LTD
View synthesis method and device
InactiveCN106384372ASolve the deformationSynthetically accurateGeometric image transformationFilling planer surface with attributesView synthesisSynthesis methods
The invention discloses a view synthesis method and device. The method comprises that Delaunay triangle dissection is carried out on a depth image corresponding to a reference image to obtain a reference image triangle; a cavity pixel point in the reference image triangle is determined; and the cavity pixel point in the reference image triangle is filled to generate a target image. According to the technical scheme, pixel information is searched in the reference image corresponding to the target image to fill a cavity by utilizing a Delaunay triangle dissection image. In DIBR view synthesis, problems that image deformation and rotation cause cavities can be solved, and view synthesis becomes more accurate.
Owner:CHONGQING UNIV +1
Medial axis extraction for complex 3D objects
A novel methodology for computing the medial axis / skeleton of a discrete binary object using a ‘divide and conquer’ algorithm, in which any 3D object is first sliced into a series of 2D images in X, Y and Z directions. Then, a geometric (Voronoi) algorithm is applied on each 2D image to extract the respective medial axis. This information is then combined to reconstruct the medial axis of the original 3D object using an intersection technique. An optional 3D interpolation step to achieve continuous connected skeletons uses Delaunay triangles and a spherical search to establish the nearest neighboring points in 3D space to interpolate between. Test results show that the proposed 3D Voronoi and optional interpolation algorithms are able to accurately and efficiently extract medial axes for complex 3D objects as well. Finally, an axis-smoothing algorithm using the same Delaunay triangle and spherical test is operable to remove unwanted noise from the extracted medial axis.
Owner:UNIVERSITY OF MANITOBA
Constrained spatial clustering method for facility location programming
InactiveCN103927432AAvoid the influence of human factorsRobust to noise pointsSpecial data processing applicationsComputer scienceSpatial configuration
The invention discloses a constrained spatial clustering method for facility location programming. The constrained spatial clustering method includes describing spatial adjacent positions of target demand points according to triangle networks; counting, constraining and recognizing spatial clustering modes of the target demand points by the aid of side lengths of the Delaunay triangle networks from an integral level and a local level; providing the decision basis for spatial configuration of service source points. Spatial constraints such as spatial hindrances and convenience can be simultaneously taken into consideration when the spatial clustering modes of the target demand points are recognized, so that the practical spatial clustering modes of the target demand points can be acquired. The constrained spatial clustering method has the advantages that users do not need to formulate the quantities of the clustering modes of the target demand points, the spatial clustering modes under the consideration of the spatial hindrances and the convenience can be acquired from the integral level and the local level and can be ultimately visually outputted, and accordingly the important decision basis can be provided for facility location programming.
Owner:CENT SOUTH UNIV
Method for processing curved surface extension data in three-dimensional geological surface model
InactiveCN105894580AQuality improvementImprove normative3D modellingData treatmentTrigonal crystal system
The invention discloses a method for processing data in a three-dimensional geological surface model. The method includes the step of finding out a set of all boundary lines and a set of all boundary triangles in a stratum surface triangular mesh, selecting the boundary lines which belong to one boundary triangle of the set of all boundary triangles in the set of all boundary lines one by one, determining the extension starting point according to the two end points of each boundary line, determining the extension step according to the boundary triangle, determining the extension direction of a curved surface according to the direction of the boundary line, the step and the normal direction of the boundary triangle, calculating the terminal point according to the starting point, the step and the extension direction of the curved surface, adding the terminal point to a point set in the three-dimensional geological surface model, and generating a topological triangular mesh by conducting two-dimensional Delaunay triangle dissection for the point set to recover the stratum shape. The quality of surface sheet unit generated is improved, and the standard and precision of the surface sheet unit are improved. The method facilitates quantified research of geological structures.
Owner:ZHEJIANG UNIV CITY COLLEGE
GNSS network differential positioning reference station network construction method and dynamic updating method
InactiveCN101498785BGuaranteed accuracy requirementsLighten the computational burdenPosition fixationDiscrete pointsNetwork construction
The invention discloses a constructing method and a dynamically updating method of a GNSS network difference positioning reference station network. In the method, each GNSS reference station is projected to a two-dimensional plane according to the known and accurate coordinates of the GNSS reference station; a reference station network taking a triangle as a basic structure is formed by the discrete points of the two-dimensional plane according to the network constructing rule of a Delaunay triangle network, and the shape of the network is unique. When a new reference station is increased or a certain reference station is not used, the real-time construction of a new network is finished through operation of point insertion or point deletion. The invention can keep the unique optimized network shape of the reference stations and meet the precision requirement when a movable station is positioned.
Owner:SOUTHEAST UNIV
Who we serve
- R&D Engineer
- R&D Manager
- IP Professional
Why Patsnap Eureka
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com