CN105354881B - Distortion of the mesh optimized algorithm based on Category Attributes data - Google Patents
Distortion of the mesh optimized algorithm based on Category Attributes data Download PDFInfo
- Publication number
- CN105354881B CN105354881B CN201510823858.2A CN201510823858A CN105354881B CN 105354881 B CN105354881 B CN 105354881B CN 201510823858 A CN201510823858 A CN 201510823858A CN 105354881 B CN105354881 B CN 105354881B
- Authority
- CN
- China
- Prior art keywords
- grid
- boundary
- search
- area
- smooth
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The present invention provides a kind of distortion of the mesh optimized algorithm based on Category Attributes data, including：Step 1, carries out range searching, formation zone grid set using a certain Category Attributes value of the seed point method for grid；Step 2, carries out zone boundary tracking, formation zone net boundary line segment aggregate, according to the syntopy of line segment coordinate analysis line segment, line segment is joined end to end in order merging, is carried out area grid boundary tracking and is formed boundary polygon set, and rejects inner boundary using area ranking method；Step 3, on the premise of Border smooth movement in constraint is carried out with region area as weight, is carried out line smoothing using five-spot and forms smooth domain border；And step 4, grid angle point is adjusted to corresponding smooth polygon, carry out grid angle point adaptive optimization.Original grid angle point adaptive optimization should be realized based on the distortion of the mesh optimized algorithm of Category Attributes data, there are problems that sawtooth etc. was rough for solving model meshes zone boundary.
Description
Technical field
The present invention relates to grid model builds and application, a kind of net based on Category Attributes data is especially related to
Lattice deform optimized algorithm.
Background technology
At present in grid model building process, it is possible to use Corner-point Grids, rectangular mesh, radial grid and destructuring
The grid systems such as grid (such as PEBI grids).The characteristics of itself is had due to each grid system, so the model for building has
The respective scope of application and characteristic, the model for such as being built based on rectangular grid system are had net region border and there is sawtooth etc.
Rough phenomenon, if do not carried out smooth optimization process to border, will affect model to describe precision and later stage simulation result of calculation
Accuracy.A kind of new distortion of the mesh optimized algorithm based on Category Attributes data is we have invented for this, solves above skill
Art problem.
Content of the invention
It is an object of the invention to provide one kind is in the case where keeping original mesh topology constant, solve to be based on rectangle
The model meshes zone boundary of grid system has that the rough distortion of the mesh based on Category Attributes data such as sawtooth is excellent
Change algorithm.
The purpose of the present invention can be achieved by the following technical measures：Distortion of the mesh optimization based on Category Attributes data is calculated
Method, should be included based on the distortion of the mesh optimized algorithm of Category Attributes data：Step 1, using seed point method for a certain of grid
Category Attributes value carries out range searching, formation zone grid set；Step 2, carries out zone boundary tracking, formation zone Grid Edge
Boundary's line segment aggregate, according to the syntopy of line segment coordinate analysis line segment, line segment is joined end to end in order merging, carries out regional network
Lattice boundary tracking forms boundary polygon set, and rejects inner boundary using area ranking method；Step 3, with region area be
On the premise of weight carrys out the smooth movement of constraint Border, line smoothing is carried out using five-spot and forms smooth domain side
Boundary；And step 4, grid angle point is adjusted to corresponding smooth polygon, carry out grid angle point adaptive optimization.
The purpose of the present invention can also be achieved by the following technical measures：
In step 1, using four neighborhood search modes, grid is traveled through, for each Category Attributes value, using seed point
Method, recursive search form the close area grid IJK set of various discrete property value, and property value filling-tag is pressed in region.
Step 1 includes：
(1) initialize, range searching is carried out to the grid of current layer K layers, zoning is come with a certain grid property value, if
Grid search mark is put, non-search grid is masked as vacation, search grid is masked as very, it is intended that a seed dot grid；
(2) set out from seed point (I, J, K), using four neighborhood search modes, respectively to the left (I-1, J, K), to the right (I+1,
J, K), (I, J-1, K), downwards (I, J+1, K) search upwards；
(3) if present orientation grid search is masked as vacation, judge whether the grid meets region condition of similarity, if search
It is then the similar grid in region that the grid property value for arriving is equal with seed point grid property value；
(4) current grid for meeting condition is saved in area grid set, the grid search is set and is masked as very, and
And new seed point is appointed as, repeat (2) (3) (4)；Skipping over for condition is unsatisfactory for, other Directional Networks of seed point are continued search for
Lattice；
(5) if 4 orientation grid search of current seed point terminate, upper other orientation of a seed point of search are returned to, until
Under the conditions of the property value, all search terminates seed point；
(6) new seed point is produced in the grid that search sign is false, repeat (2) (3) (4) (5), until grid search
Mark is all really to be terminated.
Step 2 includes：
(1) grid in a certain area grid IJK set of designated layer position K is traveled through；
(2) adjacent mesh ((I-1, J, K), (I+1, J, K), (I, J-1, K), (I, the J+ of current grid (I, J, K) are judged
1, K)) whether in the area grid set；
(3) if a certain orientation adjacent mesh is not present, the grid orientation side is remained in the set of zone boundary, the set
Special polygon data structure comprising xyz coordinates and Corner-point Grids sequence number；
(4) other grids in the searching loop area grid set, repeat (2) (3), complete Region Border Search；
(5) line segment in the polygon line segment aggregate of zone boundary is joined end to end merging, according to line segment coordinate analysis line segment
Syntopy, including head adjacent, adjacent, tail head is adjacent end to end, tail tail is adjacent, non-conterminous, line segment is linked in sequence, is chased after
Track forms area polygonal set as much as possible；
(6) sorted using area or inclusion relation algorithm, reject inner boundary, the maximum boundary polygon of area is the area
The external boundary in domain；
(7) repeat (1) (2) (3) (4) (5) (6), follow the trail of all zone boundaries for obtaining this layer.
In step 3, on the basis of the tracking of zone boundary, entered using the five-spot in segmental cubic polynomials interpolation method
Row zone boundary is smooth, and five-spot is to set up the cubic polynomial curve with continuous first derivative between each two data point
The derivative of each node of equation, wherein curve is each two adjacent points of the right and left centered on a bit, and five points come really altogether
Fixed.
Step 3 includes：
(1) by zone boundary by included grid number ascending order arrangement, it is ensured that the smooth movement on district-share border with compared with
Large area region is defined, and region area is weight；
(2) zone boundary polygon set is traveled through, smooth polygon using the five-spot in segmental cubic polynomials interpolation method
Shape, from the angle of practicality and high efficiency, disregards to grid number or the less region of area；
(3) boundary polygon after will be smooth is saved in the smooth polygon set in border, repeats (2) until all boundary is more
Side shape smooth treatment terminates.
In step 4, on the basis of zone boundary is smooth, realize rectangular mesh summit to the smooth shape of Corner-point Grids
Become, according to the corresponding Corner-point Grids sequence number of break and the sequence number of corresponding smooth polygon point of boundary polygon, carry out rectangle
Translation of the grid vertex to slick spot.
The distortion of the mesh optimized algorithm based on Category Attributes data in the present invention, using seed point method recursive search, interior
Reject external boundary tracer technique, trace regions in border.Smooth domain side is generated using 5 points of smooth algorithms of segmental cubic polynomials
Boundary, realizes original grid angle point adaptive optimization, there are problems that sawtooth etc. is rough for solving model meshes zone boundary.
Description of the drawings
Fig. 1 is the flow process of a specific embodiment of the distortion of the mesh optimized algorithm based on Category Attributes data of the present invention
Figure；
Fig. 2 is four neighborhoods and eight neighborhood search schematic diagram in a specific embodiment of the invention；
Fig. 3 is the schematic diagram of seed point method recursive search effect in a specific embodiment of the invention；
Fig. 4 is the schematic diagram of polygon line segment syntopy in a specific embodiment of the invention；
Fig. 5 be the present invention a specific embodiment in boundary polygon line segment join end to end merge flow process schematic diagram；
Fig. 6 is the schematic diagram that inner boundary rejects that external boundary follows the trail of acquisition zone boundary in a specific embodiment of the invention；
Fig. 7 is that 5 points of smooth algorithms of segmental cubic polynomials realize boundary polygon light in a specific embodiment of the invention
Sliding schematic diagram；
Fig. 8 is region boundary hypotenuse schematic diagram in a specific embodiment of the invention；
Fig. 9 is the schematic diagram of Contrast on effect before and after distortion of the mesh optimization in a specific embodiment of the invention.
Specific embodiment
For enabling the above and other objects, features and advantages of the present invention to become apparent, cited below particularly go out preferably to implement
Example, and coordinate shown in accompanying drawing, it is described in detail below.
Before zone boundary optimizes, it is necessary to carry out the process that range searching and zone boundary are followed the trail of.Whether in computer
In graphics, or in Computer Image Processing, range searching is all a basic and important operation.Based on four connections
The seed point method recursive search algorithm of domain or eight connected region is most simple, directly perceived, traditional range searching algorithm, and it has program
Simply, the advantage for expressing clearly.
Inner boundary can be used in net region boundary process is determined and rejects external boundary tracer technique, reject the side of inner boundary
Method includes area sequence or inclusion relation algorithm etc..After zone boundary is determined, distortion of the mesh transformation is into zone boundary
Smoothing Problem, conventional smooth algorithm include：Linear iteraction, segmental cubic polynomials interpolation method, quadratic polynomial weighted average
The characteristics of method, Tensive Spline Function method etc., wherein segmental cubic polynomials interpolation method (five-spot) is exactly the point of smooth line in front and back
Number keeps constant, and in addition before and after two methods fitting, control point is inconsistent with the quantity of slick spot.In order to ensure hexahedron net
Topological relation (i.e. quantity is consistent before and after the optimization of grid angle point) between lattice, the present invention adopt 5 points of segmental cubic polynomials
Smooth algorithm carries out the smooth of boundary line.
As shown in figure 1, Fig. 1 is the flow chart of the distortion of the mesh optimized algorithm based on Category Attributes data of the present invention.
In step 101, net region search, formation zone grid set are carried out using seed point method.
As there are two kinds of mode of communicating of four connections and eight connectivity in region, therefore range searching algorithm also have four neighborhood search and
Eight neighborhood search two ways (as shown in Figure 2).As the present invention carries out adaptive optimization for rectangular mesh border, it is contemplated that
Grid is to travel through by IJ directions level in the rectangle and grid that two dimensional surface is rule, in order to improve grid search efficiency (drop
Low search repetitive rate), so adopting four field ways of search.Traversal grid, for each Category Attributes value, using seed point
Method, recursive search form the close area grid IJK set of various discrete property value, and property value filling-tag is pressed (such as Fig. 3 in region
Shown)；
(1) initialize, range searching (zoning is come with a certain grid property value) is carried out to current layer (K) grid, if
Put grid search mark (non-search grid is masked as vacation, and search grid is masked as very), it is intended that seed dot grid (IJK,
1) property value is；
(2) set out from seed point (I, J, K), using four field ways of search, respectively to the left (I-1, J, K), to the right (I+1,
J, K), (I, J-1, K), downwards (I, J+1, K) search upwards；
(3) if present orientation grid search is masked as vacation, judge whether the grid meets region condition of similarity (if search
It is then the similar grid in region that the grid property value for arriving is equal with seed point grid property value)；
(4) current grid for meeting condition is saved in area grid set (if property value is 1), the grid is set and is searched
Rope is masked as very, and is appointed as new seed point, repeats (2) (3) (4)；Skipping over for condition is unsatisfactory for, seed point is continued search for
Other orientation grids；
(5) if 4 orientation grid search of current seed point terminate, upper other orientation of a seed point of search are returned to, until
Under the conditions of the property value, all search terminates seed point.
(6) new seed point is produced in the grid that search sign is false, repeat (2) (3) (4) (5).Until grid search
Mark is all really to be terminated.Flow process enters into step 102.
In step 102, zone boundary tracking is carried out, formation zone net boundary line segment aggregate carries out area grid border
Tracking forms boundary polygon set, and rejects inner boundary using area ranking method.
On the basis of range searching, rejecting external boundary tracer technique using inner boundary carries out Region Border Search.Specifically
Flow process is as follows：
(1) grid in a certain area grid IJK set of designated layer position K is traveled through；
(2) adjacent mesh ((I-1, J, K), (I+1, J, K), (I, J-1, K), (I, the J+ of current grid (I, J, K) are judged
1, K)) whether in the area grid set；
(3) if a certain orientation adjacent mesh is not present, the grid orientation side remains into zone boundary and gathers (comprising xyz
Coordinate and the special polygon data structure of Corner-point Grids sequence number) in；
(4) other grids in the searching loop area grid set, repeat (2) (3), complete Region Border Search；
(5) line segment in the polygon line segment aggregate of zone boundary is joined end to end merging, according to line segment coordinate analysis line segment
Syntopy (including head adjacent, adjacent, tail head is adjacent, tail tail is adjacent, non-conterminous end to end etc., as shown in Figure 4), by line segment
It is linked in sequence, follows the trail of and form area polygonal as much as possible (inner boundary may be included) set, as shown in Figure 5；
(6) sorted using area or inclusion relation algorithm, reject inner boundary, the maximum boundary polygon of area is the area
The external boundary in domain.
(7) repeat (1) (2) (3) (4) (5) (6), follow the trail of all zone boundaries (as shown in Figure 6) for obtaining this layer.Flow process
Enter into step 103.
In step 103, line smoothing is carried out using five-spot and forms smooth domain border.
On the basis of zone boundary is followed the trail of, zone boundary light is carried out using segmental cubic polynomials interpolation method (five-spot)
Sliding.The basic ideas of five-spot are to set up the cubic polynomial curve side with continuous first derivative between each two data point
The derivative of each node of journey, wherein curve is each two adjacent points of the right and left centered on a bit, and five points are determining altogether
's.
Idiographic flow is as follows：
(1) arrangement of grid number ascending order is pressed in zone boundary, it is ensured that the smooth movement on district-share border is with large area area
Domain is defined；
(2) zone boundary polygon set is traveled through, using the smooth polygon of segmental cubic polynomials interpolation method (five-spot),
From the angle of practicality and high efficiency, grid number or the less region of area are disregarded；
(3) boundary polygon after will be smooth is saved in the smooth polygon set in border, repeats (2) until all boundary is more
Side shape smooth treatment terminates, and effect is as shown in Figure 7.Flow process enters into step 104.
In step 104, adjustment grid angle point carries out grid angle point adaptive optimization to corresponding smooth polygon.
On the basis of zone boundary is smooth, realize rectangular mesh summit to the smooth deformation of Corner-point Grids.By 5 points of light
The feature for keeping points constant before and after sliding algorithm is smooth, it is known that smooth front zone boundary polygon with smooth treatment after smooth
Polygon points be to maintain consistent, according to the corresponding Corner-point Grids sequence number of the break of boundary polygon and corresponding smooth polygon
The sequence number of form point, carries out rectangular mesh summit to the translation (as shown in Figure 8) of slick spot, and black arrow is respective vertices movement
Direction and distance.
Effect before and after distortion of the mesh optimization optimizes front effect as shown in figure 9, Fig. 9 (a) is deformation, and Fig. 9 (b) is that grid becomes
Effect after shape optimization, it can be seen that the present invention can be very good to solve based on the distortion of the mesh optimized algorithm of Category Attributes data
The aliasing problems that certainly model meshes zone boundary is present, smooth effect are obvious.
Claims (1)
1. the distortion of the mesh optimized algorithm based on Category Attributes data, it is characterised in that grid that should be based on Category Attributes data
Deformation optimized algorithm includes：
Step 1, carries out range searching, formation zone grid set using a certain Category Attributes value of the seed point method for grid；
Step 2, carries out zone boundary tracking, and formation zone net boundary line segment aggregate, according to the neighbour of line segment coordinate analysis line segment
Relation is connect, line segment is joined end to end in order merging, carry out area grid boundary tracking and form boundary polygon set, and adopt
Area ranking method rejects inner boundary；
Step 3, on the premise of Border smooth movement in constraint is carried out with region area as weight, is carried out using five-spot
Line smoothing forms smooth domain border；
Step 4, adjustment grid angle point carry out grid angle point adaptive optimization to corresponding smooth polygon；
The step 1 includes：
（1）Initialization, carries out range searching to the grid of current layer K layers, comes zoning with a certain grid property value, arranges net
Lattice search sign, non-search grid are masked as vacation, and search grid is masked as very, it is intended that a seed dot grid；
（2）From seed point（I, J, K）Set out, using four neighborhood search modes, difference is to the left（I-1, J, K）, to the right（I+1, J,
K）, upwards（I, J-1, K）, downwards（I, J+1, K）Search；
（3）If present orientation grid search is masked as vacation, judge whether the grid meets region condition of similarity, if search
It is then the similar grid in region that grid property value is equal with seed point grid property value；
（4）The current grid for meeting condition is saved in area grid set, the grid search is set and is masked as very, and refer to
It is set to new seed point, repeats（2）（3）（4）；Skipping over for condition is unsatisfactory for, other orientation grids of seed point are continued search for；
（5）If 4 orientation grid search of current seed point terminate, upper other orientation of a seed point of search are returned to, until the category
Property value under the conditions of seed point all search terminates；
（6）New seed point is produced in the grid that search sign is false, is repeated（2）（3）（4）（5）, until grid search mark
All really terminate；
In step 1, using four neighborhood search modes, grid is traveled through, for each Category Attributes value, using seed point method, is passed
Search is returned to form the close area grid IJK set of various discrete property value, property value filling-tag is pressed in region；
The step 2 includes：
（1）Grid in a certain area grid IJK set of designated layer position K is traveled through；
（2）Judge current grid（I, J, K）Adjacent mesh（（I-1, J, K）、（I+1, J, K）、（I, J-1, K）、（I, J+1, K））
Whether in the area grid set；
（3）If a certain orientation adjacent mesh is not present, the grid orientation side is remained in the set of zone boundary, and the set includes
Xyz coordinates and the special polygon data structure of Corner-point Grids sequence number；
（4）Other grids in the searching loop area grid set, repeat（2）（3）, complete Region Border Search；
（5）Line segment in the polygon line segment aggregate of zone boundary is joined end to end merging, according to the neighbour of line segment coordinate analysis line segment
Connect relation, including head adjacent, adjacent, tail head is adjacent end to end, tail tail is adjacent, non-conterminous, and line segment is linked in sequence, and follows the trail of shape
Into area polygonal set as much as possible；
（6）Sorted using area or inclusion relation algorithm, reject inner boundary, the maximum boundary polygon of area is the region
External boundary；
（7）Repeat（1）（2）（3）（4）（5）（6）, follow the trail of all zone boundaries for obtaining this layer；
The step 3 includes：
（1）By zone boundary by the grid number ascending order arrangement for being included, it is ensured that the smooth movement on district-share border is with larger face
Product region is defined, and region area is weight；
（2）Traversal zone boundary polygon set, using the smooth polygon of five-spot in segmental cubic polynomials interpolation method, from
The angle of practicality and high efficiency is set out, and grid number or the less region of area are disregarded；
（3）Boundary polygon after will be smooth is saved in the smooth polygon set in border, repeats（2）Until all boundary polygon
Smooth treatment terminates；
In step 3, on the basis of the tracking of zone boundary, area is carried out using the five-spot in segmental cubic polynomials interpolation method
Domain border is smooth, and five-spot is to set up the cubic polynomial curve side with continuous first derivative between each two data point
The derivative of each node of journey, wherein curve is each two adjacent points of the right and left centered on a bit, and five points come really altogether
Fixed；
In step 4, on the basis of zone boundary is smooth, realize rectangular mesh summit to the smooth deformation of Corner-point Grids, root
According to the corresponding Corner-point Grids sequence number of the break of boundary polygon and the sequence number of corresponding smooth polygon point, rectangular mesh top is carried out
Translation of the point to slick spot.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510823858.2A CN105354881B (en) | 2015-11-24 | 2015-11-24 | Distortion of the mesh optimized algorithm based on Category Attributes data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510823858.2A CN105354881B (en) | 2015-11-24 | 2015-11-24 | Distortion of the mesh optimized algorithm based on Category Attributes data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105354881A CN105354881A (en) | 2016-02-24 |
| CN105354881B true CN105354881B (en) | 2017-03-15 |
Family
ID=55330848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510823858.2A Active CN105354881B (en) | 2015-11-24 | 2015-11-24 | Distortion of the mesh optimized algorithm based on Category Attributes data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105354881B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109410290B (en) * | 2017-08-16 | 2023-11-21 | 广州极飞科技股份有限公司 | Method and device for determining boundary of working area |
| CN107545577B (en) * | 2017-08-23 | 2021-05-04 | 电子科技大学 | Sedimentary facies image segmentation method based on neural network |
| CN109102558B (en) * | 2018-07-09 | 2022-09-27 | 珠江水利委员会珠江水利科学研究院 | Rapid water flow line generation method based on unstructured triangular net |
| CN110806509B (en) * | 2019-11-29 | 2021-12-17 | 广东电网有限责任公司广州供电局 | Lightning activity spatial feature detection method and device |
| CN111553963B (en) * | 2020-04-13 | 2023-05-23 | 中国能源建设集团广东省电力设计研究院有限公司 | Meta-grid generation method and device based on geographic information |
| CN111652956B (en) * | 2020-05-19 | 2023-07-07 | 中国能源建设集团广东省电力设计研究院有限公司 | Meta grid contour boundary optimization method, medium and terminal equipment |
| CN112883960B (en) * | 2021-01-25 | 2022-08-26 | 山东浪潮科学研究院有限公司 | Method and device for extracting mariculture area |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7034830B2 (en) * | 2003-03-25 | 2006-04-25 | Mitsubishi Electric Research Laboratories, Inc. | Method for generating a two-dimensional distance field within a cell associated with a corner of a two-dimensional object |
| CN101286199A (en) * | 2007-09-14 | 2008-10-15 | 西北工业大学 | Method of image segmentation based on area upgrowth and ant colony clustering |
-
2015
- 2015-11-24 CN CN201510823858.2A patent/CN105354881B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN105354881A (en) | 2016-02-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105354881B (en) | Distortion of the mesh optimized algorithm based on Category Attributes data | |
| CN103837154B (en) | The method and system of path planning | |
| CN103985155B (en) | Scattered point cloud Delaunay triangulation curved surface reconstruction method based on mapping method | |
| CN106898050B (en) | A kind of grid model adaptive layered method based on annular neighborhood reference contour line | |
| CN104282221B (en) | A kind of method for the road network for building indoor map | |
| CN107392875A (en) | A kind of cloud data denoising method based on the division of k neighbours domain | |
| CN103714577B (en) | Three-dimensional model simplification method suitable for model with textures | |
| CN105677899B (en) | A kind of enhanced vector numerical map production method comprising road direction of travel | |
| CN102306396A (en) | Three-dimensional entity model surface finite element mesh automatic generation method | |
| CN105893703B (en) | A kind of urban road network's major trunk roads choosing method based on polygon | |
| CN111858810B (en) | Modeling elevation point screening method for road DEM construction | |
| CN109214596B (en) | Method for planning shortest path of grid with direction constraint and barrier limitation | |
| CN101034482A (en) | Method for automatically generating complex components three-dimensional self-adapting finite element grid | |
| CN107396374A (en) | A kind of covering method based on fictitious force and Thiessen polygon | |
| CN110442994A (en) | A kind of 3D printing sliced sheet processing method based on graph theory | |
| CN107274422A (en) | A kind of point cloud edge extracting method combined based on normal information and K neighborhood search | |
| CN110196602A (en) | The quick underwater robot three-dimensional path planning method of goal orientation centralized optimization | |
| CN102496187A (en) | Method for tracking contour line to boundary and fault based on triangular mesh | |
| CN107679333A (en) | A kind of method of two-dimensional topology optimum results geometry reconstruction | |
| CN108831146A (en) | Generate semi-automatic cloud method of three-dimensional high-definition mileage chart intersection lane | |
| CN108256218A (en) | A kind of subterranean communication tunnel fine modeling method based on actual measurement stringcourse data | |
| CN104318611A (en) | Three-dimensional tree re-establishing method based on laser scanning point cloud | |
| CN104361625B (en) | A kind of cloud data compaction algorithm retained with border based on ray principle | |
| CN106204719A (en) | Magnanimity model real-time scheduling method in three-dimensional scenic based on two-dimensional neighbourhood retrieval | |
| Hu et al. | Geometric feature enhanced line segment extraction from large-scale point clouds with hierarchical topological optimization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |