CN101510225B - STL model boolean operation method of products - Google Patents
STL model boolean operation method of products Download PDFInfo
- Publication number
- CN101510225B CN101510225B CN2009100198971A CN200910019897A CN101510225B CN 101510225 B CN101510225 B CN 101510225B CN 2009100198971 A CN2009100198971 A CN 2009100198971A CN 200910019897 A CN200910019897 A CN 200910019897A CN 101510225 B CN101510225 B CN 101510225B
- Authority
- CN
- China
- Prior art keywords
- stl model
- stl
- intersection
- products
- model
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention provides a Boolean operation method of a product STL model, which is characterized in that a dynamic spatial indexing structure of the product STL model is constructed, a cross triangular patch between two STL models are obtained based on the structure, cross line segments of the cross triangular patch are computed according to the spatial position relation of the triangular patch, neighbor sorting of the cross line segments is implemented by constructing a dynamic spatial indexing structure of the discrete cross line segments, the cross triangular patch is subdivided according to the cross line, the STL model participating in the Boolean operation is separated into two sub STL models by the cross line which is taken as a boundary, and the separated sub STL models are combined in different ways, thus realizing the Boolean intersection, union or difference Boolean operations of the STL model. The embodiment proves that the Boolean operation method can obtain accurate cross line data, effectively improve the Boolean operation efficiency of the product STL model, and handle the Boolean operation of the product STL models with various complex molding surfaces.
Description
Affiliated technical field
The invention provides a kind of STL model boolean operation method of products, belong to field of computer aided design.
Background technology
STL model of products can be realized the surface model accurately reconstruct fast based on product design sampled data points cloud, has obtained widespread use at present in product reverse-engineering field.STL model of products to reverse-engineering system output carries out Boolean calculation, can realize operations such as the cutting out of STL model of products, splicing, and can construct the STL model of products with complex profile feature.
Existing technical literature retrieval is found, Zhang Jinyi etc. are at academic journal " Engineering Drawing journal " 2002,12 (1), during the paper of delivering on the P53-61 " is unified in the reliable polyhedron boolean set computing of tri patch ", adopt the judgement and the inference method of polyhedron concord, realize the Boolean calculation of STL model of products according to polyhedron position relation, this algorithm has guaranteed the reliability of regular shape, STL model of products Boolean calculation that data volume is few, but low to its geometric reasoning process efficiency of the STL model of products complex-shaped, that data volume is big.
Guo Kaibo etc. are at academic journal " Central China University of Science and Technology's journal " (natural science edition) 2006,34 (7), in the paper of delivering on the P96-99 " realization of STL model boolean operation ", adopt adjacency list as the STL model of products data structure, set up the bounding box of surface model intermediate cam dough sheet, the traversal bounding box obtains crossing tri patch and calculates its intersection section, two model intersections are obtained in all intersection section orderings, according to intersection subdivision STL model of products, realize the Boolean calculation of STL model of products, but the foundation and the maintenance process of tri patch adjacency list are loaded down with trivial details, need repeat to travel through adjacency list and calculate the intersection section, and the algorithm operational efficiency is low.
Tang Min etc. are at academic journal " software journal " 1999,12 (10), in the paper of delivering on the P1291-1297 " boolean operation of non-canonical accurate model ", adopt non-canonical accurate model as the geometric object data structure, carry out the level of data object based on this model and ask friendship, realize the Boolean calculation of STL model of products, this algorithm has avoided because crackle that the error of calculation causes and topological generate inconsistent, but non-canonical accurate model complex structure, it is loaded down with trivial details to obtain STL model of products intersection process, asks friendship speed slow.
Problems such as in sum, existing boolean operation method at STL model of products exists tri patch to ask friendship speed slow, lacks the valid data structure of unified structure STL model of products topological structure, and the algorithm operational efficiency is low.
Summary of the invention
The object of the present invention is to provide a kind of STL model boolean operation method of products,, reduce cost of products with effective shortening complex appearance Products Development cycle.Its technical scheme is:
STL model boolean operation method of products is characterized in that steps in sequence is: 1) read the STL model of products data in storer, and set up the linear linked list storage organization for the STL model of products data, improve R
*-tree obtains being suitable for the dynamic space index structure R of storage products STL model
*The S-tree, concrete dividing method is to be that minimum area-encasing rectangle unification is expressed as four-dimensional some object (x with tri patch and index node MBR, y, z, r), x wherein, y, z are the MBR centre coordinate, and r is a MBR circumsphere radius value, by the cluster sub-clustering of tri patch set, make up STL model of products dynamic space index structure; 2) the dynamic space index structure based on STL model of products obtains the intersection data; 3) segment intersecting tri patch according to the intersection data; 4) segmentation Vee formation dough sheet is added in the STL model of products dynamic space index structure, rebulid STL model of products dynamic space index structure, traversal STL model dynamic space index structure, the tri patch that is positioned at the intersection both sides is searched in the self-adaptation expansion, with the intersection is that the separatrix is divided into two sub-STL models with STL model of products, realize cutting apart of STL model of products, concrete dividing method is: be the primary iteration dough sheet with the arbitrary tri patch that is positioned in the STL model of products on the intersection 1.; 2. search the tri patch that comprises the non-intersection of primary iteration dough sheet limit in the STL model of products; 3. judge that whether the tri patch find is the border with the intersection, if do not exist the intersection border then to stop to search tri patch on the intersection edge direction, search the tri patch that comprises other border in the STL model of products, execution in step 3.; 4. if there are many intersections in two STL models, extract next bar intersection, execution in step 1.; 5. the tri patch that finds is split from STL model of products, STL model of products is divided into two sub-STL models along intersection; 5) according to the Boolean calculation type, will cut apart the back STL model of products and make up, realize the intersecting and merging or the difference Boolean calculation of STL model of products.
For realizing goal of the invention, described STL model boolean operation method of products is in step 2) in, establishing the two STL models that participate in Boolean calculation is S
1And S
2, according to STL model S
1The dynamic space index structure is judged STL model S
2Node MBR and STL model S in the dynamic space index structure
1Overlapping relation, if non-intersect, STL model S then
1With STL model S
2No intersection; If intersection search STL model S
1With STL model S
2The data node that intersects in the dynamic space index structure, the tri patch of storing in this data node is STL model S
1With STL model S
2The tri patch that intersects; Extract the tri patch of storing in the intersection data node, ask to hand over and obtain the intersection section, adopt R
*The S-tree is set up discrete intersection section dynamic space index structure, realizes the contiguous ordering of intersection section based on the spatial neighbor relation of discrete each layer of intersection section dynamic space index structure node.
For realizing goal of the invention, described STL model boolean operation method of products is in step 2) in, R adopted
*The S-tree is set up discrete intersection section dynamic space index structure, the step that realizes the contiguous ordering of intersection section based on the spatial neighbor relation of discrete each layer of intersection section dynamic space index structure node is specifically: I is an initial segment with arbitrary intersection section, is zero data node to the initial segment end-point distances in the discrete intersection section dynamic space index structure of inquiry; It is the intersection section of storing in zero the data node that II obtains in the discrete intersection section dynamic space index structure initial segment end-point distances, and is connected to form new initial segment with initial segment; Being zero data node to new initial segment end-point distances in the discrete intersection section dynamic space index structure of III inquiry, is zero data node execution in step II if there is distance; IV exports an intersection of two STL models, if more than one of two complicated STL model intersection, execution in step I.
Be to realize goal of the invention, described STL model boolean operation method of products, in step 5), STL model boolean operation method of products specifically: establishing two STL models is S
1And S
2, intersection is with STL model S
1Be divided into two sub-STL models, promptly be positioned at STL model S
2Inside and outside STL model, intersection are equally with STL model S
2Be divided into two sub-STL models, STL model S
1With STL model S
2The Boolean calculation formula is as follows:
S
1∩S
2＝S
1inS
2+S
2inS
1
S
1∪S
2＝S
1outS
2+S
2ouS
1
S
1-S
2＝S
1outS
2+S
2inS
1
S
2-S
1＝S
2outS
1+S
1inS
2
S in the above formula
1InS
2And S
1OutS
2Represent STL model S respectively
1Be positioned at STL model S
2Inside and outside sub-STL model, S
2InS
1And S
2OutS
1Represent STL model S respectively
2Be positioned at STL model S
1Inside and outside sub-STL model.Shipping of STL model at last with STL model S
1In S
1InS
2With STL model S
2In S
2InS
1Be combined into a curved surface, union is with STL model S
1In S
1OutS
2With STL model S
2In S
2OutS
1Be combined into a curved surface, difference operation is with STL model S
1In S
1OutS
2With STL model S
2In S
2InS
1Be combined into a curved surface or with STL model S
2In S
2OutS
1With STL model S
1In S
1InS
2Be combined into a curved surface.
The present invention compared with prior art has the following advantages:
1) adopts R
*The dynamic space index structure of S-tree tissue products STL model based on the fast query of the contiguous tri patch of this structure realization, can carry out Boolean calculation to the STL model of products of various complex profiles;
2) by successively searching each layer of dynamic space index structure node, can accurately locate the tri patch that two STL models intersect, rapid solving STL model of products intersection, that has effectively improved STL model of products asks friendship efficient;
3) obtain the tri patch that is positioned at the intersection both sides fast based on the dynamic space index structure, realize cutting apart of STL model of products, effectively improved the Boolean calculation efficient of STL model of products.
Fig. 1 is a program flow diagram of the present invention;
Fig. 2 is the STL model of products dynamic space index structure one-piece construction synoptic diagram that the present invention sets up;
Description of drawings
Fig. 3 is a dynamic space index structure index node standardization expression synoptic diagram of the present invention;
Fig. 4 is the space clustering sub-clustering realization flow figure of tri patch set of the present invention;
Fig. 5～Fig. 9 is each layer of dynamic space index structure node MBR illustraton of model that the present invention sets up spherical model;
Figure 10 is that STL model of products locus synoptic diagram is intersected in the present invention two;
Figure 11 is that the crossing ground floor node synoptic diagram of STL model of products dynamic space index structure is intersected in the present invention two;
Figure 12 is that the crossing leaf node synoptic diagram of STL model of products dynamic space index structure is intersected in the present invention two;
Figure 13 is that STL model of products dynamic space index structure intersection data node synoptic diagram is intersected in the present invention two;
Figure 14 is that the situation synoptic diagram that tri patch does not have intersection is intersected in the present invention two;
Figure 15 is that the situation synoptic diagram that tri patch has intersection is intersected in the present invention two;
Figure 16 is that the present invention obtains the intersection schematic diagram data according to the R*S-tree with mixed and disorderly intersection section ordering;
Figure 17 is the space ball synoptic diagram that the present invention two is intersected;
Figure 18 is that space ball intersection synoptic diagram is intersected in the present invention two;
Figure 19～Figure 20 is that the segmentation effect that the space ball intersects tri patch is intersected in the present invention two;
Figure 21 is that STL model of products of the present invention is cut apart preceding synoptic diagram;
Figure 22 is that STL model of products of the present invention is cut apart the back synoptic diagram;
Figure 23 is an embodiment of the invention rabbit model;
Figure 24 is that the embodiment of the invention two STL model of products positions concern synoptic diagram;
The back is cut apart at the inside and outside sub-STL model of spherical model in Figure 25～26th, embodiment of the invention rabbit model;
The back is cut apart at the inside and outside sub-STL model of rabbit model in Figure 27～28th, embodiment of the invention spherical model;
Figure 29 is the STL model after embodiment of the invention rabbit model and spherical model boolean ship calculation;
Figure 30 is the STL model after embodiment of the invention rabbit model boolean subtracts spherical model;
Figure 31 is the STL model after embodiment of the invention spherical model boolean subtracts the rabbit model;
Figure 32 is the STL model behind embodiment of the invention spherical model boolean and the rabbit model.
Embodiment
The invention will be further described below in conjunction with accompanying drawing.
Fig. 1 is the program realization flow figure of STL model of products Boolean calculation of the present invention.STL model of products data entry program 1 is responsible for reading in STL model data file, and creates linear storage organization for it.STL model of products dynamic space index structure construction procedures 2 adopts nested MBR that STL model of products is carried out the dynamic space cluster and divides, for the data linear linked list that data entry program 1 is generated is set up improved dynamic space index structure R*S-tree.The STL model of products intersection obtains the overlapping relation of program 3 according to two each layer of the STL model dynamic space index structure node MBR that participate in Boolean calculation, obtain the data node that intersects in the two model dynamic space index structures, ask friendship to obtain the intersection section by the tri patch in the intersection data node, adopt the R*S-tree to set up the dynamic space index structure of discrete intersection section, spatial neighbor relation based on each layer node in this index structure realizes the contiguous ordering of intersection data, obtains two STL model intersections.Crossing tri patch segmentation program 4 will intersect tri patch according to the intersection section of obtaining in the program 3 and carry out the triangle segmentation.STL model of products segmentation procedure 5 rebulids the dynamic space index structure of the STL model of products after the segmentation, traversal is searched this index structure, the tri patch that is positioned at the intersection both sides is searched in the self-adaptation expansion, with the intersection is that the separatrix is divided into two sub-STL models with STL model of products, realizes cutting apart of STL model of products.STL model of products Boolean calculation program 6 is according to the type of Boolean calculation, and the sub-STL model after two STL models are cut apart makes up according to different modes, realizes the intersecting and merging or the difference Boolean calculation of STL model of products.
Among Fig. 2, STL model of products dynamic space index structure is divided into index level and data Layer, and index level is made of inner node, leaf node and data node; Data Layer is a data link table, and its node has the ability of visit higher level index level.The index level node is divided into index node and data node, and the data node has only the pointer that points to concrete spatial data object.Type sign in the index node structure is used to judge that this node is inner node or leaf node, and it is inner node that type equals 0 this node of expression, and it is leaf node that type equals 1 this node of expression.The child node of leaf node is the data node, obtains concrete data object by the data node.
Among Fig. 3, with STL model of products intermediate cam dough sheet and index node MBR unified be expressed as four-dimensional some object (x, y, z, r), x wherein, y, z are the MBR centre coordinate, r is a MBR circumsphere radius value.For the upper limit M and the lower limit m of the child node number of each layer of STL model of products dynamic space index structure node, and node inserts the value of number R again, is provided with voluntarily according to the scale of STL model of products by the user, gets m=M * 40% usually, and
R＝M×30％。
Among Fig. 4, the heart is concentrated as initial cluster in the center of index node centre distance a pair of node MBR farthest, data object is added to apart from nearest bunch the concentrating of bunch concentrated heart, upgrade the concentrated heart of each bunch, and compare with an original bunch concentrated heart, if bunch concentrated heart is identical or the sub-clustering number of times then finishes sub-clustering above maximum sub-clustering number of times, otherwise continue sub-clustering.
Fig. 5～Fig. 9 is each layer of dynamic space index structure node MBR illustraton of model that spherical model of the present invention is set up.STL model of products intermediate cam dough sheet data bulk is 952, and the indexing parameter m=8, the M=20 that are adopted insert nodal point number R=6 again.Wherein Fig. 5 is the spherical model STL model of products, Fig. 6 is dynamic space index structure root node MBR, Fig. 7 is second layer node MBR, Fig. 8 is leaf node MBR, Fig. 9 is data node MBR, as can be seen from the figure, adopt the dynamic space index structure can accurately realize the space clustering division of STL model of products.
Among Figure 10, call the STL model of products intersection and obtain program 3 and obtain two STL model of products fast and intersect tri patch, establishing the two STL models that carry out Boolean calculation is S
1And S
2, according to STL model S
1The dynamic space index structure is judged STL model S
2Node MBR and STL model S in the dynamic space index structure
1Overlapping relation, if non-intersect, STL model S then
1With STL model S
2No intersection; If intersection search STL model S
1With STL model S
2The data node that intersects in the dynamic space index structure, the tri patch of storing in this data node are the tri patch that intersects with target STL model.
Call STL model of products intersection Data Acquisition Program 3, calculate the intersection section that intersects tri patch in two STL model of products.The position of space tri patch relation is divided into following two kinds of situations: 1) one of them tri patch and another plane, tri patch place are non-intersect, and promptly three summits of tri patch are all at the homonymy on another plane, tri patch place; 2) two triangular facet sheets intersect.If situation 1), two triangular facet sheets are non-intersect, do not carry out cap; If situation 2), judge whether coplane of two triangular facet sheets, if coplane then utilize three limits of tri patch and another tri patch to ask to hand over and obtain two triangular facet sheet intersection sections, with each intersection point mean value as intersection point, otherwise calculate the intersection l on plane, two triangle place, ask friendship to obtain the intersection section by l and two triangular facet sheets, the end points of determining the intersection section is corresponding to the parameter value t on the l
00, t
01, t
10And t
11As shown in figure 14, if T
01≤ T
10Or T
11≤ t
00, two triangular facet sheets do not have intersection; As shown in figure 15, if t
01＞t
10Or t
11＞t
00, two triangular facet sheets intersect, and distribute according to parameter value and find the solution the intersection section of two triangular facet sheets, make the starting point of intersection section and the last parameter value of straight line l of terminal point correspondence be respectively t
0And t
1, according to formula
Calculate t
0And t
1Value, obtain the intersection section.The intersection section that intersects tri patch is the line segment of one group of chaotic, obtaining complete intersection needs its ordering, adopt the R*S-tree to set up the dynamic space index structure of discrete intersection section, realize the contiguous ordering of intersection section based on the spatial neighbor relation of this each layer of structure node.The acquisition process of two STL model of products intersection data as shown in figure 16, line segment E
0Be initial segment, arrive E in the inquiry R*S-tree index structure
0End points P
0Distance is zero data node MBR
1, obtain MBR
1Middle storage intersection section E
1Connect E
0With E
1And arrive E in the inquiry R*S-tree index structure
1End points P
1Distance is zero data node MBR
2, obtain MBR
2Middle storage intersection section E
2Connect E
1With E
2, data node in the iterative query R*S-tree index structure until inquiring all intersection sections, finally obtains intersection of two STL models.
Figure 17 is the ball synoptic diagram that the present invention two is intersected, and sets up the dynamic space index structure of two balls, calls the intersection that STL model of products STL model intersection Data Acquisition Program 3 is asked two models, as shown in figure 18.Call and intersect tri patch segmentation program 4, with intersection section end points serves as that the segmentation point carries out triangle constraint Delaunay segmentation to intersecting tri patch, restrained boundary is three limits of intersection section and tri patch, the segmentation effect that the left side ball intersects tri patch as shown in figure 19, the segmentation effect that the right side ball intersects tri patch is as shown in figure 20.
Segmentation Vee formation dough sheet is added in the STL model of products dynamic space index structure, rebulid STL model of products dynamic space index structure.With the intersection both sides that the tri patch of public boundary is positioned at intersection, traversal STL model of products dynamic space index structure, the tri patch that is positioned at the intersection both sides is searched in the self-adaptation expansion, is that the separatrix is divided into two sub-STL models with STL model of products with the intersection, realizes cutting apart of STL model of products.Call STL model of products segmentation procedure 5 and realize cutting apart of STL model of products, shown in Figure 21 for cutting apart preceding STL model of products, tri patch T
1Be the primary iteration dough sheet, by tri patch T
1Find tri patch T
2With tri patch T
3, by tri patch T
2Find tri patch T
4With tri patch T
5, by tri patch T
3Find tri patch T
6, by tri patch T
4Find tri patch T
7With tri patch T
8, call STL model segmentation procedure 5, realize cutting apart of this STL model, segmentation effect is as shown in figure 22.
Call STL model of products Boolean calculation program 6, two STL model of products and carry out Boolean calculation.STL model of products shown in Figure 5 and rabbit model shown in Figure 23 are carried out Boolean calculation, the locus of two STL model of products as shown in figure 24, after asking for two model intersections, cut apart two STL models based on this intersection, Figure 25 is that inventive embodiments rabbit model is cut apart the sub-STL model of back in spherical model inside, Figure 26 is that inventive embodiments rabbit model is cut apart the sub-STL model of back in the spherical model outside, Figure 27 is that the inventive embodiments spherical model is cut apart the sub-STL model of back in rabbit model inside, and Figure 28 is that the inventive embodiments spherical model is cut apart the sub-STL model of back in rabbit model outside.According to STL model of products Boolean calculation type, rabbit model and spherical model are carried out boolean's intersecting and merging or difference Boolean calculation, Figure 29 is that inventive embodiments two model boolean ship calculation back STL model, Figure 30 is that inventive embodiments rabbit model boolean subtracts STL model behind the spherical model, Figure 31 is that inventive embodiments spherical model boolean subtracts STL model behind the rabbit model, and Figure 32 is a STL model behind boolean's union of inventive embodiments two models.
The boolean operation method of other products STL model is the same.
Claims (4)
1. the boolean operation method of a STL model of products, it is characterized in that steps in sequence is: 1) read the STL model of products data in storer, and set up the linear linked list storage organization for the STL model of products data, improve R*-and set the dynamic space index structure R*S-tree that obtains being suitable for storage products STL model, concrete dividing method is to be that minimum area-encasing rectangle unification is expressed as four-dimensional some object (x with tri patch and index node MBR, y, z, r), x wherein, y, z is the MBR centre coordinate, r is a MBR circumsphere radius value, by the cluster sub-clustering of tri patch set, makes up STL model of products dynamic space index structure; 2) the dynamic space index structure based on STL model of products obtains the intersection data; 3) segment intersecting tri patch according to the intersection data; 4) segmentation Vee formation dough sheet is added in the STL model of products dynamic space index structure, rebulid STL model of products dynamic space index structure, traversal STL model dynamic space index structure, the tri patch that is positioned at the intersection both sides is searched in the self-adaptation expansion, with the intersection is that the separatrix is divided into two sub-STL models with STL model of products, realize cutting apart of STL model of products, concrete dividing method is: be the primary iteration dough sheet with the arbitrary tri patch that is positioned in the STL model of products on the intersection 1.; 2. search the tri patch that comprises the non-intersection of primary iteration dough sheet limit in the STL model of products; 3. judge that whether the tri patch find is the border with the intersection, if do not exist the intersection border then to stop to search tri patch on the intersection edge direction, search the tri patch that comprises other border in the STL model of products, execution in step 3.; 4. if there are many intersections in two STL models, extract next bar intersection, execution in step 1.; 5. the tri patch that finds is split from STL model of products, STL model of products is divided into two sub-STL models along intersection; 5) according to the Boolean calculation type, will cut apart the back STL model of products and make up, realize the intersecting and merging or the difference Boolean calculation of STL model of products.
2. the boolean operation method of STL model of products as claimed in claim 1 is characterized in that: in step 2) in, establishing the two STL models that participate in Boolean calculation is S
1And S
2, according to STL model S
1The dynamic space index structure is judged STL model S
2Node MBR and STL model S in the dynamic space index structure
1Overlapping relation, if non-intersect, STL model S then
1With STL model S
2No intersection; If intersection search STL model S
1With STL model S
2The data node that intersects in the dynamic space index structure, the tri patch of storing in this data node is STL model S
1With STL model S
2The tri patch that intersects; Extract the tri patch of storing in the intersection data node, ask to hand over and obtain the intersection section, adopt the R*S-tree to set up discrete intersection section dynamic space index structure, realize the contiguous ordering of intersection section based on the spatial neighbor relation of discrete each layer of intersection section dynamic space index structure node.
3. the boolean operation method of STL model of products as claimed in claim 2 is characterized in that: adopt R
*The S-tree is set up discrete intersection section dynamic space index structure, the step that realizes the contiguous ordering of intersection section based on the spatial neighbor relation of discrete each layer of intersection section dynamic space index structure node is specifically: I is an initial segment with arbitrary intersection section, is zero data node to the initial segment end-point distances in the discrete intersection section dynamic space index structure of inquiry; It is the intersection section of storing in zero the data node that II obtains in the discrete intersection section dynamic space index structure initial segment end-point distances, and is connected to form new initial segment with initial segment; Being zero data node to new initial segment end-point distances in the discrete intersection section dynamic space index structure of III inquiry, is zero data node execution in step II if there is distance; IV exports an intersection of two STL models, if more than one of two complicated STL model intersection, execution in step I.
4. the boolean operation method of STL model of products as claimed in claim 1, it is characterized in that: in step 5), establishing two STL models is S
1And S
2, intersection is with STL model S
1Be divided into two sub-STL models, promptly be positioned at STL model S
2Inside and outside STL model, intersection are equally with STL model S
2Be divided into two sub-STL models, STL model S
1With STL model S
2The Boolean calculation formula is as follows:
S
1∩S
2＝S
1inS
2+S
2inS
1
S
1∪S
2＝S
1outS
2+S
2outS
1
S
1-S
2＝S
1outS
2+S
2inS
1
S
2-S
1＝S
2outS
1+S
1inS
2
S in the above formula
1InS
2And S
1OutS
2Represent STL model S respectively
1Be positioned at STL model S
2Inside and outside sub-STL model, S
2InS
1And S
2OutS
1Represent STL model S respectively
2Be positioned at STL model S
1Inside and outside sub-STL model; Shipping of STL model at last with STL model S
1In S
1InS
2With STL model S
2In S
2InS
1Be combined into a curved surface; Union is with STL model S
1In S
1OutS
2With STL model S
2In S
2OutS
1Be combined into a curved surface; Difference operation is with STL model S
1In S
1OutS
2With STL model S
2In S
2InS
1Be combined into a curved surface or with STL model S
2In S
2OutS
1With STL model S
1In S
1InS
2Be combined into a curved surface.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100198971A CN101510225B (en) | 2009-03-26 | 2009-03-26 | STL model boolean operation method of products |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100198971A CN101510225B (en) | 2009-03-26 | 2009-03-26 | STL model boolean operation method of products |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101510225A CN101510225A (en) | 2009-08-19 |
| CN101510225B true CN101510225B (en) | 2011-03-30 |
Family
ID=41002625
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100198971A Expired - Fee Related CN101510225B (en) | 2009-03-26 | 2009-03-26 | STL model boolean operation method of products |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101510225B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5022508B1 (en) * | 2011-06-02 | 2012-09-12 | 三菱重工業株式会社 | Shape measurement method |
| CN102508973B (en) * | 2011-11-10 | 2014-07-02 | 山东理工大学 | Rapid intersection method for STL (stereo lithography) models of products |
| CN102682476B (en) * | 2012-05-15 | 2015-11-25 | 深圳市旭东数字医学影像技术有限公司 | The boolean operation method of triangle grid data and system thereof |
| CN104525668B (en) * | 2014-11-12 | 2016-06-08 | 常州工学院 | Shape method adjusted by the drift of a kind of multi-point forming processing curve |
| CN104392030B (en) * | 2014-11-12 | 2017-05-03 | 常州工学院 | Curved surface machining method based on STL (Standard Template Library) three-dimensional model |
| CN105022865B (en) * | 2015-06-30 | 2018-04-17 | 西安交通大学 | A kind of fuel tanker inner surface model extraction method based on STL model boolean operations |
| CN107037738B (en) * | 2016-11-16 | 2019-09-27 | 清华大学 | Material removal method based on STL model in geometry Simulation of NC Machining |
| CN107609268B (en) * | 2017-09-12 | 2020-06-05 | 上海同岩土木工程科技股份有限公司 | TIN-based three-dimensional geological model and BIM model coupling method |
| CN107599404B (en) * | 2017-09-21 | 2020-01-17 | 中科院广州电子技术有限公司 | Vertical projection intersection method for FDM three-dimensional printing vertical support model |
| CN108608639B (en) * | 2017-11-02 | 2020-07-24 | 常熟理工学院 | 3D printing system based on virtual instrument |
| CN110435156A (en) * | 2019-09-09 | 2019-11-12 | 安徽卓锐三维科技有限公司 | A kind of dicing method for realizing 3D printing in revolving body arc-shaped surface based on RPM technology |
| CN112401866A (en) * | 2020-11-11 | 2021-02-26 | 中国科学技术大学 | Electrical impedance imaging method based on Boolean operation |
| CN112597871B (en) * | 2020-12-18 | 2023-07-18 | 中山大学 | Unsupervised vehicle re-identification method, system and storage medium based on two-stage clustering |
| CN115859524B (en) * | 2022-12-21 | 2023-08-22 | 南京信息工程大学 | Cylinder Boolean difference operation method based on STL model |
| CN117349914B (en) * | 2023-12-06 | 2024-03-08 | 南京信息工程大学 | Boolean operation method based on surrounding number |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101025831A (en) * | 2006-02-24 | 2007-08-29 | 山东理工大学 | Rapid precise constructing and shaping method for complex curved face product |
| CN101034482A (en) * | 2006-03-07 | 2007-09-12 | 山东理工大学 | Method for automatically generating complex components three-dimensional self-adapting finite element grid |
-
2009
- 2009-03-26 CN CN2009100198971A patent/CN101510225B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101025831A (en) * | 2006-02-24 | 2007-08-29 | 山东理工大学 | Rapid precise constructing and shaping method for complex curved face product |
| CN101034482A (en) * | 2006-03-07 | 2007-09-12 | 山东理工大学 | Method for automatically generating complex components three-dimensional self-adapting finite element grid |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101510225A (en) | 2009-08-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101510225B (en) | STL model boolean operation method of products | |
| CN102306396B (en) | Three-dimensional entity model surface finite element mesh automatic generation method | |
| CN102298795B (en) | Three-dimensional segmenting method for STL (Standard Template Library) triangular network model | |
| CN101403907B (en) | Five-coordinate NC tool track fast generation method for scattered point cloud data | |
| CN102508973B (en) | Rapid intersection method for STL (stereo lithography) models of products | |
| Zhou et al. | A review on 3D spatial data analytics for building information models | |
| CN105427317A (en) | Method suitable for multi-view-angle automatic registration of ground laser point cloud data of multiple stations | |
| CN101403909B (en) | Triangular gridding subdivision curved surface NC tool track fast generation method | |
| CN104318622B (en) | Triangular mesh modeling method of indoor scene inhomogeneous three dimension point cloud data | |
| CN102074052A (en) | Sampling point topological neighbor-based method for reconstructing surface topology of scattered point cloud | |
| CN101373543A (en) | Method for rapidly cutting three-dimensional gridding model | |
| CN103970949B (en) | A kind of rapid shaping intermediate cam patch model by side layered approach | |
| CN101403908B (en) | High-precision numerical control machining tool track fast generation method for triangular gridding curved surface model | |
| CN102853803B (en) | Testing method of damaged area of cultural relic | |
| CN112221144B (en) | Three-dimensional scene path finding method and device and three-dimensional scene map processing method and device | |
| CN104392053A (en) | Skin roll-bending part sectional curvature analysis method | |
| CN101430693B (en) | Spacing query method for triangular gridding curve model | |
| CN103838907A (en) | Curved surface cutting trajectory obtaining method based on STL model | |
| CN108171799B (en) | Method for reconstructing triangular mesh of laminated area | |
| CN114332291A (en) | Oblique photography model building outer contour rule extraction method | |
| CN107886569A (en) | It is a kind of that controllable surface parameterization method and system are estimated based on discrete Lie derivatives | |
| CN107610228A (en) | Curved surface increment topology rebuilding method based on massive point cloud | |
| CN115661374A (en) | Rapid retrieval method based on space division and model voxelization | |
| CN104715507B (en) | A kind of three-dimensional geographical entity method for auto constructing based on patch | |
| CN102012908B (en) | Method for inquiring visible moving neighbours objects in environment with barriers |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110330 Termination date: 20120326 |