CN107633555A - The mutual cutting method of curved surface collection and system based on spacescan - Google Patents
The mutual cutting method of curved surface collection and system based on spacescan Download PDFInfo
- Publication number
- CN107633555A CN107633555A CN201710835245.XA CN201710835245A CN107633555A CN 107633555 A CN107633555 A CN 107633555A CN 201710835245 A CN201710835245 A CN 201710835245A CN 107633555 A CN107633555 A CN 107633555A
- Authority
- CN
- China
- Prior art keywords
- triangle
- scanning
- curved surface
- patch
- spatial
- 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.)
- Granted
Links
Landscapes
- Image Generation (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a kind of curved surface collection based on spacescan mutually to cut realization method and system, this method and system are supplied to the technology that a kind of a large amount of curved surfaces of efficient process of user are mutually cut, triangle can be completed in the scanning process of single and intersects detection, again scheduling memory, multiple links such as trigonometric ratio, the generation of result patch, it can overcome the inconsistence problems such as more curved surface concurrents in cutting calculations two-by-two, conllinear, coplanar and self intersection；Loaded by streaming, safeguard the patch that the triangle intersected with the plane of scanning motion, output storage as early as possible are completed and discharge a variety of methods such as the internal memory of its occupancy to reduce the data volume involved by calculating, reduce calculation scale；The calculating of each step eliminates the reliance on all data processings of back and finished in cutting process, and often step can be completed parallel, be particularly suitable for high-performance computing environment.
Description
Technical field
The present invention relates to three-dimension curved surface cutting technique, is that a kind of curved surface collection based on spacescan is mutually cut specifically
Cut realization method and system.
Background technology
With the development of surveying and mapping technology and dimensional Modeling Technology, people gradually have ready conditions construction it is all kinds of complicated and fine three
Tie up ground object model.The structure of these three-dimensional ground object models often relates to a large amount of three-dimension curved surfaces and cut each other, and then rejects more
Remaining part point, kneading different surfaces are an entirety.Typically completing the thinking that three-dimension curved surface is mutually cut is：Each Surface Construction list
Only index, then carries out intersecting calculating for a pair two-by-two, accelerates triangle collision detection by indexing in calculating process, from some
The intersection location detected follows the trail of intersection to complete cutting calculations.But there is also the problem of following several respects for the above method：
(1) a pair of progress cutting calculations two-by-two, multiple curved surfaces by and in the case of intersecting at space same point easily
Produce inconsistency；
(2) if some tri patch and multiple surface intersections, then this tri patch by taking turns cutting meeting two-by-two more
Repeatedly trigonometric ratio, and trigonometric ratio process order slit influences again occurs, it is possible to create non-globally optimal solution；
(3) intersecting judgement is only carried out to the triangle surface from different curve, it is difficult to find exist in same curved surface
Self intersection phenomenon；
(4) N number of three-dimension curved surface needs to carry out N* (N-1)/2 that time cutting calculations, calculation scale may become very huge two-by-two
Greatly；
(5) generation of result dough sheet needs intersecting finally completing for process two-by-two, now just can guarantee that all intersecting
Triangle, which is processed, to be finished, and when the data volume of single curved surface is very big, can consume a large amount of internal memories；
(6) although the cutting calculations two-by-two between a large amount of curved surfaces can support parallelization to calculate as basic arithmetic element,
But curved surface data structure needs to support parallel work-flow, need to coordinate in cutting process when same curved surface is in parallel cutting process
Comformity relation, but each Parallel Unit is corresponding complete cutting process, consistency maintenance is extremely difficult.
The content of the invention
The technical problem to be solved in the present invention is, for the technological deficiency of above-mentioned (1) to (6), there is provided one kind is based on
The curved surface collection of spacescan mutually cuts realization method and system, especially a kind of three-dimension curved surface for being applied to a large amount of placements at random
Mutually cutting realization method and system.
According to the wherein one side of the present invention, the present invention is its technical problem of solution, there is provided one kind is based on spacescan
The mutual cutting method of curved surface collection, comprise the following steps：
Curved surface collection dynamic load internal memory in order to participating in cutting；
Two-dimentional dynamically spatial-data index is established to safeguard the triangle information representing currently intersected with the plane of scanning motion；
The upper V-type summit for the edge scanning direction of advance established in priority query's management surface boundary；
Handle the renewal and adjustment of the space index structure triggered because scanning upper V-type summit；
Handle the renewal and adjustment of the space index structure triggered by the intermediate vertex for scanning triangle；
Handle the renewal and adjustment of the space index structure triggered by the end vertex for scanning triangle；
The trigonometric ratio again of triangle is completed in processing scanning；
Generation, growth, branch, merging and the end of result patch；
Wherein, so-called upper V-type summit refers to the border vertices for meeting following conditions on the border of curved surface：The two of border vertices
The spatial classification of individual adjacent vertex is both greater than the spatial classification of the border vertices, and any one triangle on fillet summit
The spatial classification of any one point in shape is all bigger than the spatial classification of the border vertices；The spatial classification passes through priority team
Order in row embodies, and the order in priority query is according to the suitable of dimension where scanning direction of advance to other any dimensions
What sequence was designed, and to be sorted for the space coordinates lexcographical order of point.
In the mutual cutting method of curved surface collection of the present invention, to curved surface collection, dynamic load internal memory is in the following manner in order
Carry out：
The space occupied in each dimension is calculated the curved surface for participating in calculating respectively, and is entered according to the maximum dimension that extends
Row sequence, only just dispatches the curved surface to internal memory, above-mentioned clooating sequence when spacescan plane starts to intersect with some curved surface
The exactly order that intersects of scanning space plane and each curved surface, thus can in scanning process according to the sequence sequentially plus
Carry each curved surface.
In the mutual cutting method of curved surface collection of the present invention, for safeguarding the triangle information representing currently intersected with the plane of scanning motion
Two-dimentional dynamically spatial-data index structure be R tree space indexes, R+ tree space indexes, R* tree space indexes and Quadtree Spatial Index
In any one.
In the mutual cutting method of curved surface collection of the present invention, the triangle information representing bag safeguarded in two-dimentional dynamically spatial-data index
Include：Triangle is abutted corresponding to the source curved surface of the triangle, the side do not intersected with the plane of scanning motion, with the neighbour in spatial index
Connect triangle, the intersection collection completely by having been detected in adjacent triangle sets corresponding to the side of the plane of scanning motion, triangle
Close.
In the mutual cutting method of curved surface collection of the present invention, only when the plane of scanning motion is in contact with curved surface first, calculate
The upper V-type summit of edge scanning direction of advance in the surface boundary.
In the mutual cutting method of curved surface collection of the present invention, the spatial index knot triggered because scanning upper V-type summit is handled
The renewal and adjustment of structure, are specifically included：
The curved surface and topology situation associated according to V-type summit on this, obtains all triangles for including V-type summit on this,
Source curved surface is set to each triangle, and first kind adjoining triangle is arranged to the relative triangle in the side do not intersected with the plane of scanning motion
Shape, the second class adjoining triangle are arranged to in spatial index and adjacent with the triangle of the triangle Border, the 3rd class
Connect triangle and be arranged to intersection set with completely by the relative triangle in the side of the plane of scanning motion, having been detected in triangle
It is arranged to each triangle and calculates intersection acquired results with the triangle in spatial index；
Triangle filters unrelated triangle by spatial index in itself during calculating intersection；
Triangle calculates intersection process and specifically included：By the way that triangle is converted into parametric equation, analysis meets two simultaneously
The solution of individual triangle parametric equation and its border obtain intersect at 1 point, intersect at 1 line segment, intersect at a triangle surface,
Intersect at a quad patch, the situation for intersecting at a pentagon dough sheet, intersecting at a hexagon dough sheet ...；
The overlapping public patch of multiple curved surfaces is separately as a result patch；
The calculating of above-mentioned intersection can also update the triangle information representing in space index structure simultaneously, as long as these triangles
Shape intersects with new triangle to be added.
In the mutual cutting method of curved surface collection of the present invention, handle what is triggered by the intermediate vertex for scanning some triangle
The renewal and adjustment of space index structure, can be refined as：
The untreated triangle of intermediate vertex comprising some triangle with the processing method on upper V-type summit
Manage identical, add these untreated triangles into space index structure；
The structure of syntople also needs to consider comprising the summit between triangle in triangle information representing renewal process
Handle triangle：Triangle where the side for having completed scanning of the renewal using the intermediate vertex of some triangle as end points
Shape information, scanning side is completed in the triangle addition being adjacent and correspondingly abutted in triangle sets.
In the mutual cutting method of curved surface collection of the present invention, the processing scanning the end vertex of some triangle because drawing
The renewal and adjustment of the space index structure of hair, can be refined as：
The triangle for completing scanning is removed out space index structure；
With the triangle of these removals adjacent and triangle in spatial index update its completed to scan side it is corresponding
Adjoining triangle information representing；
The present invention the mutual cutting method of curved surface collection in, processing scanning complete triangle trigonometric ratio again pass through it is following
Mode is carried out：
Intersection and triangle border described in the triangle information representing, which are used as, to be constrained into row constraint trigonometric ratio；
To the former triangle of above-mentioned completion scanning, if its some adjoining triangles still in spatial index, triangle
The new triangle renewal that change is constructed has been completed scanning side to these adjoining triangles and correspondingly abutted in triangle sets.
In the mutual cutting method of curved surface collection of the present invention, the generation of result patch, growth, branch, merge with
Terminate, can be refined as：
As a result patch produces：If triangle caused by new without and after having completed triangle and the heavy trigonometric ratio of scanning
Triangle have topological adjacency, then indicate the generation of a new patch；
As a result patch grows：To the former triangle of above-mentioned completion scanning, also complete to scan if it abuts triangle,
So since with the adjoining triangle public vertex, all summits for being connected and having completed scanning add the top of result patch
Point set, all triangles being made up of above-mentioned summit add result patch triangle sets；
As a result patch branch：If result patch is broken as multiple not interconnecting parts along the plane of scanning motion on growth border
Point, then need to handle branch, the multiple not connected components differentiated are cascaded by chained list；It is each that connected component can not
To be referred to as a growing point；
As a result patch merges：Each result patch grown safeguards alone its vertex set and triangle collection
Close, such as run into makes two or three result patch form an entirety of connection because some triangle scan is completed, then needs
Merge the vertex set and triangle sets of two or three result patch, update the vertex index in triangle sets；
As a result patch terminates：If some completes the triangle of scanning, its adjoining triangle also all completes scanning, and its
There is no the growing point of other differentiation, then the result dough sheet terminates to handle, and produces a complete result patch, and algorithm is most
Whole output；To improve memory usage, the result patch newly produced can be saved directly in external memory or database, together
When discharge the internal memory that the patch occupies.
According to another aspect of the present invention, the present invention additionally provides one kind and is based on spacescan to solve its technical problem
The mutual diced system of curved surface collection, comprising：
Internal memory dynamic load unit, for the curved surface collection dynamic load internal memory in order to participating in cutting；
Spatial index establishes unit, and currently intersect with the plane of scanning motion three are safeguarded for establishing two-dimentional dynamically spatial-data index
Angular information；
Priority query establishes unit, for establishing the edge scanning direction of advance in priority query's management surface boundary
Upper V types summit；
Upper V-type vertex processing unit, for handle the renewal of the space index structure triggered because scanning upper V-type summit with
Adjustment；
Intermediate vertex processing unit, for handling the space index structure triggered by the intermediate vertex for scanning triangle
Renewal and adjustment；
End vertex processing unit, for handling the space index structure triggered by the end vertex for scanning triangle
Renewal and adjustment；
Again trigonometric ratio processing unit, the trigonometric ratio again for completing triangle is scanned for handling；
Patch processing unit, for the generation of result patch, growth, branch, merging and end；
Wherein, so-called upper V-type summit refers to the border vertices for meeting following conditions on the border of curved surface：The two of border vertices
The spatial classification of individual adjacent vertex is both greater than the spatial classification of the border vertices, and any one triangle on fillet summit
The spatial classification of any one point in shape is all bigger than the spatial classification of the border vertices；The spatial classification passes through priority team
Order in row embodies, and the order in priority query is according to the suitable of dimension where scanning direction of advance to other any dimensions
What sequence was designed, and to be sorted for the space coordinates lexcographical order of point.
The curved surface collection based on spacescan for implementing the present invention mutually cuts realization method and system, has below beneficial to effect
Fruit：The present invention is supplied to the technology that a kind of a large amount of curved surfaces of efficient process of user are mutually cut, can be in the scanning process of single
Complete triangle and intersect detection, again scheduling memory, multiple links such as trigonometric ratio, the generation of result patch, it can overcome two
The inconsistence problems such as more curved surface concurrents, conllinear, coplanar and self intersection in two cutting calculations；Loaded, safeguarded and swept by streaming
Retouch the intersecting triangle of plane, output stores the patch completed and discharges its internal memory taken and (stores side in scanning as early as possible
Release) etc. a variety of methods calculate involved data volume to reduce, reduce calculation scale；The calculating of each step is not in cutting process
Rely on all data processings of back again to finish, often step can be completed parallel, be particularly suitable for high-performance computing environment.
Brief description of the drawings
Below in conjunction with drawings and Examples, the invention will be further described, in accompanying drawing：
The theory diagram of the mutual diced system of curved surface collection based on spacescan method of Fig. 1 present invention；
Fig. 2 is the schematic diagram of mean camber of the present invention；
Fig. 3 is the flow chart of the mutual cutting method of curved surface afflux based on spacescan method of the present invention.
Embodiment
In order to which technical characteristic, purpose and the effect of the present invention is more clearly understood, now compares accompanying drawing and describe in detail
The embodiment of the present invention.
As shown in figure 1, the mutual diced system of curved surface collection based on spacescan method of the present invention includes curved surface loader
101st, ShangVXing summits priority query 102, spatial index 103, patch growth chained list 104 and result generator 105, wherein：
Curved surface loader 101, exist for receiving in other curved surface modeling modules or reading external memory
Curved surface data set, it is assumed that y-axis direction is spacescan direction, and main sequence during spatial classification, x-axis are spatial classification
When the 1st secondary sequence, the 2nd secondary sequence when z-axis is spatial classification.Spatial classification is secondary according to the secondary sequence-the 2 of main sequence-the 1 to spatial point
Sequence carries out linear ordering, and the coordinate difference of main sequence dimension is then sorted by main sequence, and the 1st is just pressed when only main sequence coordinate is just the same
Secondary sequence sequence；If the coordinate in the 1st secondary sequence is also identical, sorted by the 2nd secondary sequence；If it is so phase that the 2nd secondary sequence is also identical
Same coordinate points.
To avoid the equal judgement of floating number in spatial classification, it is necessary to which regulation data processing precision ε, that is, space are swept
Minimum step when retouching, space are divided into the three-dimensional grid of small cubes composition according to the scanning step, fall on same small vertical
Three-dimensional point in cube thought with identical coordinate value, the three-dimensional in all small cubes in the grid face of main sequence
Point has identical main sequence coordinate.
Above-mentioned curved surface loader 101 is minimum to spatially being sorted in each curved surface vertex set of curved surface data concentration of loading
Point carries out spatial classification, obtains curved surface dispatching sequence's table L；If input is the result data of curved surface modeling module, or does not prop up
Hold from external memory random read take curved surface, then curved surface data collection is cached in external memory in itself；Curved surface loader 101 is according to each
Individual curved surface is scheduled with the order that intersects of spacescan plane, this sequentially with curved surface dispatching sequence's table L curved surface order one
Cause, therefore by judging that the position relationship of the first curved surface and the plane of scanning motion in curved surface dispatching sequence's table L can determine the need for
Load next curved surface.
Curved surface loader 101 needs to calculate border to each curved surface just loaded, and exports upper V-type summit row therein
Table, the border of main curved surface include inner boundary and external boundary.If function Ord (V) obtains summit V spatial classification, then V-type top is gone up
Point meets:
Ord (V) ＜ Ord (Vprev) and Ord (V) ＜ Ord (Vnext) and Ord (V) ＜ Ord (Pany)
VprevThe former point for being V on surface boundary, VnextFor latter point, continuous on surface boundary and sequence number identical
Summit should merge into 1；PanyFor any point in using V as the triangle on summit.
On the implication on upper V summits, Fig. 2 is refer to, figure mean camber is by triangle sets into any two adjacent triangle has
One common edge；Any one summit belongs to 1 and arrives multiple triangles.Upper V-type summit as shown in the leftmost summit 6 in figure,
When the position of scanning plane S scannings to the summit 6, all triangles of summit association are all in S right, and other summits are without this
Individual property, the border vertices with such property are upper V summits.
ShangVXing summits priority query 102, for receiving the upper V-type summit of the output of curved surface loader 101, V on these
Type summit is sorted from small to large still according to the spatial classification order defined in curved surface loader 101, and queue heads are spaces
The upper V-type summit for the minimum that sorts, rear of queue are the maximum upper V-type summits of spatial classification, can be with the priority query of selection standard
And redefine ranking functions；Order of elements reflects the order of spacescan in ShangVXing summits priority query 102, scanning
Upper V-type summit in the new curved surface of process loading can be added dynamically to the correct position in the queue.
Spatial index 103, team's head element (upper V-type summit) for receiving ShangVXing summits priority query 102 are associated
Triangle, and safeguard and all triangles for intersecting with Current Scan plane of assisted lookup.Each indexed in spatial index 103
Entry includes：Minimum outsourcing rectangle R that triangle source curved surface M, triangle project in the plane of scanning motion, with not reached in triangle
The plane of scanning motion while adjoining triangle JComing, intersect with the plane of scanning motion while the triangle JOne and JTwo that abut and
The intersection set SInter detected in the triangle sets JPass that has been abutted by the side of the plane of scanning motion, triangle.
Spatial index 103 is realized in this specific embodiment on the basis of grid index, its sizing grid is using average
2 times of triangle direction bounding box longest edge；Each grid safeguards a triangle list intersected with the grid, same rope
Draw items for information to share in multiple grids of leap.
Intersection set Sinter structure is divided into two parts：When a part is that the triangle adds spatial index 103, lead to
Cross to inquire about the other triangles intersected with it and calculate intersection and obtain；Another part is that follow-up triangle adds spatial index
When 103, the intersection come in is updated because intersecting with the triangle.The intersection of the acquisition of front portion can also update each intersecting
In the intersection set Sinter of triangle.
Patch grows chained list 104, one patch growing point of each of which node on behalf, for reception space index 103
In just completed the triangle of scanning, and complete to link with the chained list coherent element by the JPass of triangle set, performance
The growth of the patch gone out for neotectonics；It can be traced back to and its two other side by JOne and JTwo information in the triangle
Adjacent triangle, and update its JPass and one of JOne and JTwo；Swept if above-mentioned adjacent triangle also completes
Retouch to be merged together and be then added in patch growth chained list 104.
If the if triangle associated by the JOne and JTwo of the triangle being newly added in patch growth chained list 104
Still in spatial index 103, then patch growth chained list 104 will increase by two nodes, one of to replace JPass nodes,
The growing point corresponding to two sides is described respectively, shows as the branch of chained list 104；If JOne does not associate any triangle with JTwo
Shape, then need to extract original description JPass node from chained list 104, show as chained list merging；If some patch is given birth to
The long node of chained list 104 is sky, represents the patch processing and terminates, and its all composition three is traced by the node of last deletion
It is angular, the output as patch growth chained list 104.
As a result generator 105, the triangle sets that patch growth chained list 104 exports is received, form (the top for being adapted to storage
Point set, triangle collection) new data organization model, rope of each triangle that wherein triangle is concentrated by its summit in vertex set
Quotation marks describe；As a result generator 105 is also responsible for adjusting back Output function model, is further handled or data preserve.
The curved surface collection based on spacescan of the present invention mutually cuts each building block tandem in the system of realization
Together, the output of previous part is the input of latter component, and each part can be while new input be received
Output is produced, without being finished when all data inputs, therefore each part can be with concurrent working.
As shown in figure 3, the mutual cutting method of curved surface afflux based on spacescan method of the present invention comprises the following steps：
Step 201：Calculate each curved surface summit centralized space sequence minimal point；The step is completed by curved surface loader 101.
Step 202：Spatial classification is carried out to the minimum point set of previous step；The step is completed by curved surface loader 101.
Step 203：The plane of scanning motion moves forward, and is moved to curved surface dispatching sequence table L header elements and ShangVXing summits priority query
Spatial classification in 102 team's head elements is compared with the plane that dot determines；The step is completed by primary control program.
Step 204：Judge the whether inswept curved surface dispatching sequence table L header elements of the plane of scanning motion；
Step 205：Curved surface corresponding to loading L header elements, calculates its all upper V-type summit, is inserted into priority query
In 102；The step is completed by curved surface loader 101.
Step 206：Judge whether the team's head element of priority query 102 is upper V-type summit；
Step 207：Upper V-type summit corresponding to the team's head element of processing priority queue 102, all three comprising the summit
It is angular to be added in spatial index 103；The step is completed by master control function.
Step 208：Judge the team's head element of priority query 102 whether and meanwhile be also some triangles intermediate vertex；
Step 209：The triangle using the team's head element corresponding vertex of priority query 102 as intermediate vertex is handled, is just completed
The adjoining topological relation shared between the side triangle is established on one side of scanning；
Step 210：Judge the team's head element of priority query 102 whether and meanwhile be also some triangles end vertex；Such as
Fruit is no, then necessarily also has untreated complete triangle, must continue to scan on；
Step 211：The triangle using the team's head element corresponding vertex of priority query 102 as end vertex is handled, is just completed
Adjoining topological relation of two of scanning when foundation shares this between triangle；
Step 212：To completely by the triangle of the plane of scanning motion again trigonometric ratio, now included in the triangle and this
Intersection between the intersecting other triangles of triangle；These intersections and original side, which are used as, to be constrained into row constraint trigonometric ratio；
Step 213：The topological adjacency relation between the triangle after trigonometric ratio again is safeguarded, the foundation of these relations is being swept
Retouch the generation (scanning opposite direction do not associate vertex of a triangle) that dough sheet is shown as on direction, growth (summit surrounded entirely),
Branch's (there is the summit broken and lacked scanning direction), merging (scanning opposite direction, which has, breaks scarce summit), (scanning direction does not associate for end
Vertex of a triangle)；The step is completed by patch growth chained list 104.
Step 214：Handle all new triangles being added in spatial index 101 and other triangles in 101
Overlapping relation between shape；Triangle caused by new includes part, intermediate vertex and the end vertex of the introducing of upper V-type summit by opening up
Flutter the part of relation introducing；The step is completed by master control function utilization space index 103.
Step 215：Result curved surface is produced, the patch closed completely in patch growth chained list 104 switchs to be complete
Representation of a surface form；The step is completed by result generator 105.
Embodiments of the invention are described above in conjunction with accompanying drawing, but the invention is not limited in above-mentioned specific
Embodiment, above-mentioned embodiment is only schematical, rather than restricted, one of ordinary skill in the art
Under the enlightenment of the present invention, in the case of present inventive concept and scope of the claimed protection is not departed from, it can also make a lot
Form, these are belonged within the protection of the present invention.
Claims (10)
1. a kind of mutual cutting method of curved surface collection based on spacescan, it is characterised in that comprise the following steps：
Curved surface collection dynamic load internal memory in order to participating in cutting；
Two-dimentional dynamically spatial-data index is established to safeguard the triangle information representing currently intersected with the plane of scanning motion；
The upper V-type summit for the edge scanning direction of advance established in priority query's management surface boundary；
Handle the renewal and adjustment of the space index structure triggered because scanning upper V-type summit；
Handle the renewal and adjustment of the space index structure triggered by the intermediate vertex for scanning triangle；
Handle the renewal and adjustment of the space index structure triggered by the end vertex for scanning triangle；
The trigonometric ratio again of triangle is completed in processing scanning；
Generation, growth, branch, merging and the end of result patch；
Wherein, so-called upper V-type summit refers to the border vertices for meeting following conditions on the border of curved surface：Two neighbours of border vertices
The spatial classification for connecing summit is both greater than the spatial classification of the border vertices, and in any one triangle on fillet summit
Any one point spatial classification it is all bigger than the spatial classification of the border vertices；The spatial classification passes through in priority query
Order embody, the order in priority query is entered according to the order of dimension where scanning direction of advance to other any dimensions
Row design, and to be sorted for the space coordinates lexcographical order of point.
2. the mutual cutting method of curved surface collection according to claim 1, it is characterised in that to curved surface collection dynamic load in order
Internal memory is carried out in the following manner：
The space occupied in each dimension is calculated the curved surface for participating in calculating respectively, and is arranged according to the maximum dimension that extends
Sequence, the curved surface is only just dispatched when spacescan plane starts to intersect with some curved surface to internal memory, and pressed in scanning process
Each curved surface is sequentially loaded according to the sequence.
3. the mutual cutting method of curved surface collection according to claim 1, it is characterised in that for safeguarding currently and the plane of scanning motion
The two-dimentional dynamically spatial-data index structure of intersecting triangle information representing is R tree space indexes, R+ tree space indexes, R* tree space indexes
And any one in Quadtree Spatial Index.
4. the mutual cutting method of curved surface collection according to claim 1, it is characterised in that tieed up in two-dimentional dynamically spatial-data index
The triangle information representing of shield includes：It is adjacent triangle corresponding to the source curved surface of the triangle, the side do not intersected with the plane of scanning motion, same
Adjoining triangle in spatial index, completely by adjacent triangle sets corresponding to the side of the plane of scanning motion, triangle
The intersection set detected.
5. the mutual cutting method of curved surface collection according to claim 4, it is characterised in that processing because scanning upper V-type summit and
The renewal and adjustment of the space index structure of initiation, are specifically included：
The curved surface and topology situation associated according to V-type summit on this, obtains all triangles for including V-type summit on this, to every
Individual triangle sets source curved surface, and first kind adjoining triangle is arranged to the relative triangle in the side do not intersected with the plane of scanning motion,
Second class adjoining triangle is arranged to abut three with spatial index and with the triangle of the triangle Border, the 3rd class
It is angular to be arranged to and completely by the relative triangle in the side of the plane of scanning motion, the intersection set detected in triangle is set
Intersection acquired results are calculated for the triangle in each triangle and spatial index；
Triangle filters unrelated triangle by spatial index in itself during calculating intersection；
Triangle calculates intersection process and specifically included：By the way that triangle is converted into parametric equation, analysis meets two three simultaneously
The solution of angular parametric equation and its border, which obtain, to intersect at 1 point, intersects at 1 line segment, intersect at a triangle surface, be intersecting
In a quad patch, the situation for intersecting at a pentagon dough sheet, intersecting at a hexagon dough sheet ...；
The overlapping public patch of multiple curved surfaces is separately as a result patch；
The calculating of above-mentioned intersection can also update triangle information representing in space index structure simultaneously, if these triangles with
New triangle to be added intersects.
6. the mutual cutting method of curved surface collection according to claim 1, it is characterised in that processing is because scanning some triangle
Intermediate vertex and the renewal and adjustment of space index structure triggered, can be refined as：
The untreated triangle of intermediate vertex comprising some triangle and the processing method on upper V-type summit carry out processing phase
Together, these untreated triangles are added into space index structure；
The structure of syntople also needs to consider to include the processed of the summit between triangle in triangle information representing renewal process
Triangle：Triangle letter where the side for having completed scanning of the renewal using the intermediate vertex of some triangle as end points
Breath, scanning side is completed in the triangle addition being adjacent and correspondingly abutted in triangle sets.
7. the mutual cutting method of curved surface collection according to claim 1, it is characterised in that processing is because scanning some triangle
End vertex and the renewal and adjustment of space index structure triggered, can be refined as：
The triangle for completing scanning is removed out space index structure；
With the triangle of these removals adjacent and triangle in spatial index update its completed to scan side it is corresponding adjacent
Connect triangle information representing.
8. the mutual cutting method of curved surface collection according to claim 1, it is characterised in that triangle is completed in the processing scanning
Trigonometric ratio again carry out in the following manner：
Intersection and triangle border described in the triangle information representing, which are used as, to be constrained into row constraint trigonometric ratio；
To the former triangle of above-mentioned completion scanning, if its some adjoining triangles still in spatial index, trigonometric ratio structure
The new triangle renewal built out has been completed scanning side to these adjoining triangles and correspondingly abutted in triangle sets.
9. the mutual cutting method of curved surface collection according to claim 1, it is characterised in that the generation of result patch,
Growth, branch, merging and end, it can be refined as：
As a result patch produces：If triangle caused by new without and completed after the triangle and weight trigonometric ratio that scan three
It is angular to have topological adjacency, then to indicate the generation of a new patch；
As a result patch grows：To the former triangle of above-mentioned completion scanning, also complete to scan if it abuts triangle, then
Since with the adjoining triangle public vertex, all summits for being connected and having completed scanning add the vertex set of result patch
Close, all triangles being made up of above-mentioned summit add result patch triangle sets；
As a result patch branch：If result patch is broken as multiple not connected components along the plane of scanning motion on growth border,
Then need to handle branch, the multiple not connected components differentiated are cascaded by chained list；Each connected component can be with
A referred to as growing point；
As a result patch merges：Each result patch grown safeguards alone its vertex set and triangle sets,
Such as run into makes two or three result patch form an entirety of connection because some triangle scan is completed, then needs to close
And the vertex set and triangle sets of two or three result patch, update the vertex index in triangle sets；
As a result patch terminates：If some completes the triangle of scanning, its adjoining triangle also all completes scanning, and it does not have
The growing point of other differentiation, then the result dough sheet terminate to handle, produce a complete result patch, the result newly produced
Patch can be saved directly in external memory or database, while discharges the internal memory that the patch occupies.
10. a kind of mutual diced system of curved surface collection based on spacescan, it is characterised in that include：
Internal memory dynamic load unit, for the curved surface collection dynamic load internal memory in order to participating in cutting；
Spatial index establishes unit, and the triangle currently intersected with the plane of scanning motion is safeguarded for establishing two-dimentional dynamically spatial-data index
Information；
Priority query establishes unit, for establishing the upper V of the edge scanning direction of advance in priority query's management surface boundary
Type summit；
Upper V-type vertex processing unit, for handling renewal and the tune of the space index structure triggered because scanning upper V-type summit
It is whole；
Intermediate vertex processing unit, for handling the renewal of the space index structure triggered by the intermediate vertex for scanning triangle
With adjustment；
End vertex processing unit, for handling the renewal of the space index structure triggered by the end vertex for scanning triangle
With adjustment；
Again trigonometric ratio processing unit, the trigonometric ratio again for completing triangle is scanned for handling；
Patch processing unit, for the generation of result patch, growth, branch, merging and end；
Wherein, so-called upper V-type summit refers to the border vertices for meeting following conditions on the border of curved surface：Two neighbours of border vertices
The spatial classification for connecing summit is both greater than the spatial classification of the border vertices, and in any one triangle on fillet summit
Any one point spatial classification it is all bigger than the spatial classification of the border vertices；The spatial classification passes through in priority query
Order embody, the order in priority query is entered according to the order of dimension where scanning direction of advance to other any dimensions
Row design, and to be sorted for the space coordinates lexcographical order of point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710835245.XA CN107633555B (en) | 2017-09-15 | 2017-09-15 | Curved surface set mutual cutting method and system based on space scanning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710835245.XA CN107633555B (en) | 2017-09-15 | 2017-09-15 | Curved surface set mutual cutting method and system based on space scanning |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107633555A true CN107633555A (en) | 2018-01-26 |
| CN107633555B CN107633555B (en) | 2019-12-17 |
Family
ID=61102403
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710835245.XA Expired - Fee Related CN107633555B (en) | 2017-09-15 | 2017-09-15 | Curved surface set mutual cutting method and system based on space scanning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107633555B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113642062A (en) * | 2021-10-18 | 2021-11-12 | 广州中望龙腾软件股份有限公司 | Topological geometric data representation method of three-dimensional model, terminal and storage medium |
| CN114589824A (en) * | 2021-11-01 | 2022-06-07 | 青岛高测科技股份有限公司 | Cutting device of silicon rod cutting system and silicon rod cutting system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1967596A (en) * | 2006-08-14 | 2007-05-23 | 东南大学 | Construction method of triangulation of 3D scattered point set in 3D scan system |
| CN101807308A (en) * | 2009-02-12 | 2010-08-18 | 富士通株式会社 | Three-dimensional model segmenting device and method |
| CN102930597A (en) * | 2012-09-28 | 2013-02-13 | 中国科学院自动化研究所 | Processing method for three-dimensional model of external memory |
-
2017
- 2017-09-15 CN CN201710835245.XA patent/CN107633555B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1967596A (en) * | 2006-08-14 | 2007-05-23 | 东南大学 | Construction method of triangulation of 3D scattered point set in 3D scan system |
| CN101807308A (en) * | 2009-02-12 | 2010-08-18 | 富士通株式会社 | Three-dimensional model segmenting device and method |
| CN102930597A (en) * | 2012-09-28 | 2013-02-13 | 中国科学院自动化研究所 | Processing method for three-dimensional model of external memory |
Non-Patent Citations (2)
| Title |
|---|
| 张争艳等: "快速成型中粗糙STL模型细分算法", 《机械工程学报》 * |
| 方军等: "顾及几何特征的规则激光点云分割方法", 《测绘通报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113642062A (en) * | 2021-10-18 | 2021-11-12 | 广州中望龙腾软件股份有限公司 | Topological geometric data representation method of three-dimensional model, terminal and storage medium |
| CN113642062B (en) * | 2021-10-18 | 2022-03-15 | 广州中望龙腾软件股份有限公司 | Topological geometric data representation method of three-dimensional model, terminal and storage medium |
| CN114589824A (en) * | 2021-11-01 | 2022-06-07 | 青岛高测科技股份有限公司 | Cutting device of silicon rod cutting system and silicon rod cutting system |
| CN114589824B (en) * | 2021-11-01 | 2024-02-02 | 青岛高测科技股份有限公司 | Cutting device of silicon rod cutting system and silicon rod cutting system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107633555B (en) | 2019-12-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108595858B (en) | BIM-based lightweight advanced treatment working method | |
| CN116310192B (en) | Urban building three-dimensional model monomer reconstruction method based on point cloud | |
| CN110363861B (en) | Laser radar point cloud-based field crop three-dimensional reconstruction method | |
| CN109377561A (en) | A kind of digital-to-analogue surface mesh generation method based on conformal geometry | |
| CN106934826B (en) | Rock slope structure refined modeling and block identification method | |
| CN106373184B (en) | A kind of 3 D-printing model puts required amount of support Method of fast estimating | |
| CN105354883A (en) | 3ds Max fast and precise three-dimensional modeling method and system based on point cloud | |
| CN103258345A (en) | Method for extracting parameters of tree branches based on ground laser radar three-dimensional scanning | |
| CN102663801A (en) | Method for improving three-dimensional model rendering performance | |
| JP2005038219A (en) | Method for generating volume data from boundary expression data and program therefor | |
| CN103970949B (en) | A kind of rapid shaping intermediate cam patch model by side layered approach | |
| CN110188423A (en) | A kind of linear engineering structure fast B IM modeling method based on FEM meshing | |
| CN101403909B (en) | Triangular gridding subdivision curved surface NC tool track fast generation method | |
| CN112419511B (en) | Three-dimensional model file processing method and device, storage medium and server | |
| KR20140062831A (en) | Method for acquiring and processing a variety of three-dimensional data to product a precise wide-area scale model | |
| CN108171793A (en) | A kind of method for detecting lamination area triangle gridding | |
| CN104392053A (en) | Skin roll-bending part sectional curvature analysis method | |
| CN107633555A (en) | The mutual cutting method of curved surface collection and system based on spacescan | |
| CN114332291A (en) | Oblique photography model building outer contour rule extraction method | |
| CN104574517A (en) | Processing method and device for boundary surface grid cell of three-dimensional model | |
| CN115587451A (en) | Dynamic updating method of webpage-side triangular patch model based on voxel division | |
| CN105894553B (en) | A kind of Street Space form layout method based on grid selection | |
| CN111210520A (en) | Reverse forming method and system for physical model | |
| CN113536617B (en) | Method for rapidly generating fine finite element model with complex structure | |
| CN107037738A (en) | The material based on STL models removes algorithm in geometry Simulation of NC Machining |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20191217 Termination date: 20200915 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |