Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

77 results about "Delaunay triangle" patented technology

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:北京网格天地软件技术股份有限公司

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

Generating system and method for high-precision three-dimensional navigation map of fully mechanized mining face

The invention discloses a generating system and a method for generating a high-precision three-dimensional navigation map of a fully mechanized mining face, and is adapted for use in the technical field of unmanned mining. The generating system comprises a channel wave seismometer, a laser radar, a combined navigation device, a ground penetrating radar and a data processing unit. The data processing unit acquires data collected by various sensors and then conducts coordinate conversion, feature fusion and consistency processing for the acquired data to generate a Delaunay triangle network of acoal seam, a fault / fold and a roadway; draws a high-precision profile map of the triangle map, calculates a topological relationship of the profile map, generates a topological data structure of theprofile map, establishes a navigation information automatic query database platform based on the high-precision profile map, and constructs the high-precision three-dimensional navigation map of the fully mechanized mining face. The high-precision three-dimensional navigation map generated by the invention can provide accurate the thickness information of the coal seam, the varied dip angle of thecoal seam and the position of the dangerous geological structure space for the fully mechanized mining equipment, and has functions of high-precision positioning, information sensing and path planning.
Owner:CHINA UNIV OF MINING & TECH

Three-dimensional fluorescence spectrum feature extraction method based on two-dimensional Gabor wavelet

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

Rapid base station irradiation range calculation and updating method

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

Constrained spatial clustering method for facility location programming

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

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
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products