CN117456115B - Method for merging adjacent three-dimensional entities - Google Patents
Method for merging adjacent three-dimensional entities Download PDFInfo
- Publication number
- CN117456115B CN117456115B CN202311800949.5A CN202311800949A CN117456115B CN 117456115 B CN117456115 B CN 117456115B CN 202311800949 A CN202311800949 A CN 202311800949A CN 117456115 B CN117456115 B CN 117456115B
- Authority
- CN
- China
- Prior art keywords
- polygon
- adjacent
- dimensional
- model
- dimensional solid
- 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
- 238000000034 method Methods 0.000 title claims abstract description 57
- 239000007787 solid Substances 0.000 claims abstract description 127
- 238000012545 processing Methods 0.000 claims abstract description 22
- 238000010276 construction Methods 0.000 claims abstract description 9
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000013507 mapping Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Geometry (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Civil Engineering (AREA)
- Architecture (AREA)
- Software Systems (AREA)
- Computer Graphics (AREA)
- Structural Engineering (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a method for merging adjacent three-dimensional entities, which comprises the following steps: acquiring a first three-dimensional solid model and a second three-dimensional solid model, decomposing the first three-dimensional solid model and the second three-dimensional solid model to obtain a first polygon set and a second polygon set, and carrying out adjacent searching in the second polygon set according to any one first polygon in the first polygon set to obtain an adjacent second polygon adjacent to the first polygon; if the first polygon is not completely intersected with the second three-dimensional solid model, the first polygon is subjected to extension processing to obtain an extension polygon; and performing extension treatment on the extension polygon to obtain an extension first three-dimensional entity model, and performing incremental merging treatment on the extension first three-dimensional entity model and the extension second three-dimensional entity model to obtain a three-dimensional entity building structure model. According to the invention, the disjoint columnar member three-dimensional solid models are extended and combined, so that the effective construction of the three-dimensional solid models is ensured when the disjoint condition exists between the columnar member three-dimensional solid models.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a method for merging adjacent three-dimensional entities.
Background
Along with the proposal of the concepts of digital city, digital building and the like, the requirement of quickly building a building model close to a real city in a virtual space is increasing. However, in order to quickly build a three-dimensional digital city model, it is critical to obtain the actual contour data of each building in the city through the cadastral mapping result. Cadastral mapping results contain a large amount of two-dimensional vector building contour data, which can generally represent different floors of a building, different structural properties, and a division between a main house and additional houses. In the prior art, a simple columnar three-dimensional solid component is generally obtained by drawing a contour line and stretching, and a complex three-dimensional solid building structure is constructed by carrying out Boolean combination on a plurality of columnar three-dimensional solid components by a construction solid geometry method.
However, in the practical process, it is found that gaps may exist between the three-dimensional solid components due to mapping errors, and the three-dimensional solid components do not necessarily intersect. When gaps exist, effective Boolean intersection combination cannot be performed, so that the three-dimensional entity building structure cannot be constructed.
Accordingly, the prior art is still in need of improvement and development.
Disclosure of Invention
The invention mainly aims to provide a method for merging adjacent three-dimensional entities, which aims to solve the problem that in the prior art, effective Boolean intersection merging cannot be performed when gaps exist among three-dimensional entity components, so that a three-dimensional entity building structure cannot be built.
In order to achieve the above object, the present invention provides a method for merging adjacently constructed three-dimensional entities, the method comprising the steps of:
A first three-dimensional solid model and a second three-dimensional solid model are obtained, the first three-dimensional solid model and the second three-dimensional solid model are decomposed to obtain a first polygon set and a second polygon set, and adjacent searching is carried out in the second polygon set according to any one first polygon in the first polygon set to obtain an adjacent second polygon adjacent to the first polygon;
If the first polygon is not completely intersected with the second three-dimensional solid model, the first polygon is subjected to extension processing to obtain an extension polygon;
And carrying out extension processing on the first three-dimensional entity model according to the extension polygon to obtain an extension first three-dimensional entity model, and carrying out incremental merging processing on the extension first three-dimensional entity model and the second three-dimensional entity model to obtain a three-dimensional entity building structure model.
Optionally, in the method for merging adjacent three-dimensional entities, the acquiring a first three-dimensional entity model and a second three-dimensional entity model, decomposing the first three-dimensional entity model and the second three-dimensional entity model to obtain a first polygon set and a second polygon set, and performing adjacent search in the second polygon set according to any one first polygon in the first polygon set to obtain an adjacent second polygon adjacent to the first polygon, including:
Acquiring a first three-dimensional solid model and a second three-dimensional solid model, decomposing the first three-dimensional solid model to obtain a first polygon set, and decomposing the second three-dimensional solid model to obtain a second polygon set;
and obtaining any one first polygon in the first polygon set and any one second polygon in the second polygon set, and performing adjacent calculation according to the first polygon and the second polygon to obtain an adjacent second polygon adjacent to the first polygon.
Optionally, the method for merging adjacent three-dimensional entities includes performing adjacent computation according to the first polygon and the second polygon to obtain an adjacent second polygon adjacent to the first polygon, and specifically includes:
calculating an included angle and a first distance between the first polygon and the second polygon;
when the included angle is smaller than a preset included angle and the first distance is smaller than a preset distance, obtaining a projection polygon of the first polygon on the plane of the second polygon;
and when the projection polygon is intersected with the second polygon, judging that the second polygon is an adjacent polygon of the first polygon, and obtaining an adjacent second polygon adjacent to the first polygon.
Optionally, in the method for merging adjacent three-dimensional entities, when the projected polygon intersects the second polygon, determining that the second polygon is an adjacent polygon of the first polygon, and obtaining an adjacent second polygon adjacent to the first polygon further includes:
The intersection judgment is carried out on the projection polygon and the second polygon, and when any side of the projection polygon is intersected with the second polygon, the intersection of the projection polygon and the second polygon is judged;
Or when any vertex of the projected polygon is within the range of the second polygon, determining that the projected polygon intersects the second polygon.
Optionally, the method for merging adjacent three-dimensional entities includes, when the projected polygon intersects the second polygon, determining that the second polygon is an adjacent polygon of the first polygon, and obtaining an adjacent second polygon adjacent to the first polygon, and then further includes:
Calculating a plurality of second distances between the first polygon and a plurality of adjacent polygons when the first polygon corresponds to the adjacent polygons;
And acquiring the adjacent polygons corresponding to the minimum distance values in the second distances, and taking the adjacent polygons corresponding to the minimum distance values as adjacent second polygons of the first polygons.
Optionally, in the method for merging adjacent three-dimensional entities, if the first polygon is not completely intersected with the second three-dimensional entity model, performing extension processing on the first polygon to obtain an extended polygon, and further including:
Acquiring a normal line of the first polygon, and generating rays along the normal line by each vertex in the first polygon;
and judging whether the ray has an intersection point with the plane of the adjacent second polygon, if so, judging that the first polygon is not completely intersected with the second three-dimensional entity model.
Optionally, in the method for merging adjacent three-dimensional entities, if the first polygon is not completely intersected with the second three-dimensional entity model, performing extension processing on the first polygon to obtain an extended polygon, which specifically includes:
if the first polygon is not completely intersected with the second three-dimensional entity model, calculating a plurality of third distances between the intersection point and the plurality of vertexes, and generating a distance set from all the third distances;
and obtaining the maximum distance in the distance set, and controlling each vertex in the first polygon to extend the maximum distance along the direction of the normal line to obtain the extended polygon after the first polygon is extended.
Optionally, the method for merging adjacent three-dimensional entities further includes:
And if the intersection point does not exist between the ray and the plane of the adjacent second polygon, judging that the first polygon is completely intersected with the second three-dimensional entity model.
Optionally, in the method for merging adjacent three-dimensional entities, the extending the first three-dimensional entity model according to the extending polygon to obtain an extending first three-dimensional entity model, and performing incremental merging on the extending first three-dimensional entity model and the second three-dimensional entity model to obtain a three-dimensional entity building structure model, which specifically includes:
Updating the first three-dimensional solid model according to the coordinate values corresponding to the extended polygon to obtain an extended first three-dimensional solid model after the first three-dimensional solid model is extended;
Combining the second three-dimensional solid model with the extended first three-dimensional solid model according to a construction solid geometry method to obtain a three-dimensional solid model;
and performing incremental merging treatment on the three-dimensional entity model to obtain a three-dimensional entity building structure model.
Optionally, the method for merging adjacent three-dimensional entities includes performing incremental merging on the three-dimensional entity model to obtain a three-dimensional entity building structure model, and specifically includes:
combining the three-dimensional solid model with a first preset component three-dimensional solid model to obtain an incremental three-dimensional solid model;
And merging the increment three-dimensional entity model with a second preset member three-dimensional entity model to obtain the three-dimensional entity building structure model.
In the method, a first three-dimensional solid model and a second three-dimensional solid model are obtained, the first three-dimensional solid model and the second three-dimensional solid model are decomposed to obtain a first polygon set and a second polygon set, and adjacent searching is carried out in the second polygon set according to any one first polygon in the first polygon set to obtain an adjacent second polygon adjacent to the first polygon; if the first polygon is not completely intersected with the second three-dimensional solid model, the first polygon is subjected to extension processing to obtain an extension polygon; and carrying out extension processing on the first three-dimensional entity model according to the extension polygon to obtain an extension first three-dimensional entity model, and carrying out incremental merging processing on the extension first three-dimensional entity model and the second three-dimensional entity model to obtain a three-dimensional entity building structure model. Decomposing a three-dimensional solid model of a columnar member to obtain a plurality of polygon sets, and carrying out adjacent search on the polygon sets to obtain adjacent polygons; judging whether the three-dimensional solid models of the columnar components are disjoint or not according to the adjacent polygons, if so, performing extension treatment on the three-dimensional solid models of the columnar components to achieve intersection, and performing component merging through the three-dimensional solid models of the intersected columnar components to obtain a merged three-dimensional solid model, so that component merging among the three-dimensional solid models of the disjoint columnar components can be ensured, and the construction of the three-dimensional solid model is facilitated.
Drawings
FIG. 1 is a flow chart of a preferred embodiment of the method of merging adjacently constructed three-dimensional entities of the present invention;
FIG. 2 is a schematic overall flow diagram of a preferred embodiment of the method for merging adjacently constructed three-dimensional entities of the present invention;
FIG. 3 is a schematic view of a three-dimensional solid member of a preferred embodiment of the proximity-structured three-dimensional solid merging method of the present invention;
FIG. 4 is a schematic diagram of a three-dimensional physical building of a preferred embodiment of the merging system for adjacently constructing three-dimensional entities of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more clear and clear, the present invention will be further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
Along with the proposal of the concepts of digital city, digital building and the like, the requirement of quickly building a building model close to a real city in a virtual space is increasing. However, in order to quickly build a three-dimensional digital city model, it is critical to obtain the actual contour data of each building in the city through the cadastral mapping result. Cadastral mapping results contain a large amount of two-dimensional vector building contour data, which can generally represent different floors of a building, different structural properties, and a division between a main house and additional houses. In the prior art, a simple columnar three-dimensional solid component is generally obtained by drawing a contour line and stretching, and a complex three-dimensional solid building structure is constructed by carrying out Boolean combination on a plurality of columnar three-dimensional solid components by a construction solid geometry method.
However, in the practical process, it is found that gaps may exist between the three-dimensional solid components due to mapping errors, and the three-dimensional solid components do not necessarily intersect. When gaps exist, effective Boolean intersection combination cannot be performed, so that the three-dimensional entity building structure cannot be constructed. The invention realizes a method for adjacent extension and intersection of three-dimensional solid components, and models a complex three-dimensional solid building structure in an extension and intersection Boolean combination mode.
As shown in fig. 1 and 2, the method for merging neighboring three-dimensional entities according to the preferred embodiment of the present invention includes the following steps:
Step S10, a first three-dimensional solid model and a second three-dimensional solid model are obtained, the first three-dimensional solid model and the second three-dimensional solid model are decomposed to obtain a first polygon set and a second polygon set, and adjacent searching is carried out in the second polygon set according to any one first polygon in the first polygon set to obtain an adjacent second polygon adjacent to the first polygon.
Specifically, a first three-dimensional solid model and a second three-dimensional solid model are obtained, the first three-dimensional solid model is decomposed to obtain a first polygon set, and the second three-dimensional solid model is decomposed to obtain a second polygon set.
As shown in fig. 3, the basic model (i.e., the second three-dimensional solid model in the present invention) is S, where S may be a single columnar three-dimensional solid member or a merged three-dimensional solid model obtained by boolean merging for multiple times; the component model (i.e., the first three-dimensional solid model in the present invention) is V, which is a columnar three-dimensional solid component, and the goal is to combine V into S to obtain a structured three-dimensional solid model.
Decomposing a component model V (the model surface consists of polygonal surfaces, each surface of the model surface is a polygon, and a polygon set can be obtained by traversing all surfaces) into a polygon setThe base model S is decomposed into polygon sets/>。
Acquiring any one first polygon in the first polygon set and any one second polygon in the second polygon set, and calculating an included angle and a first distance between the first polygon and the second polygon; and when the included angle is smaller than a preset included angle and the first distance is smaller than a preset distance, acquiring a projection polygon of the first polygon on the plane of the second polygon.
The intersection judgment is carried out on the projection polygon and the second polygon, and when any side of the projection polygon is intersected with the second polygon, the intersection of the projection polygon and the second polygon is judged; or when any vertex of the projected polygon is within the range of the second polygon, determining that the projected polygon intersects the second polygon.
And when the projection polygon is intersected with the second polygon, judging that the second polygon is an adjacent polygon of the first polygon, and obtaining an adjacent second polygon adjacent to the first polygon.
Wherein the first polygon and the adjacent second polygon are polygons in which an adjacent relationship exists between the first polygon set and the second polygon set; the first polygon belongs to the first polygon set, and the adjacent second polygon belongs to a polygon in adjacent relation with the first polygon in the second polygon set.
Calculating each polygon of the component model VCenter/>Plane/>Normal/>Calculate the basis model S per polygon/>Plane/>Normal/>。
When polygonal(I.e., the first polygon in the present invention) and/>(I.e., the second polygon in the present invention) included angles of less than 5 degrees and distances of less than 0.2 meters, and/>In plane/>Projection onto/>When intersecting (the polygon projected onto the plane is a two-dimensional polygon, two-phase intersection judgment is performed on each side of the two polygons of the projected polygon and the second polygon, if any two sides intersect, the polygons intersect, or whether each vertex of the projected polygon is in another polygon, if yes, the polygons intersect), the/>, is judgedAnd/>Is an adjacent polygon.
Calculating a plurality of second distances between the first polygon and a plurality of adjacent polygons when the first polygon corresponds to the adjacent polygons; and acquiring the adjacent polygons corresponding to the minimum distance values in the second distances, and taking the adjacent polygons corresponding to the minimum distance values as adjacent second polygons of the first polygons.
When (when)There are multiple adjacencies/>When only the nearest/>. Wherein the polygon included angle refers to normal/>And/>Included angle of/>, whereinRefers to a polygon/>The normal of,/>, is invertedThe inversion is because the adjacent surface normals are opposite. Wherein/>And/>Distance of (2) means/>Center/>To plane/>The distance between two planes is approximately expressed as the distance between the polygon center and the plane.
And step S20, if the first polygon is not completely intersected with the second three-dimensional solid model, performing extension processing on the first polygon to obtain an extension polygon.
Specifically, acquiring a normal line of the first polygon, and generating rays along the normal line by each vertex in the first polygon;
And judging whether the ray has an intersection point with the plane of the adjacent second polygon, if so, judging that the first polygon is not completely intersected with the second three-dimensional entity model. And if the intersection point does not exist between the ray and the plane of the adjacent second polygon, judging that the first polygon is completely intersected with the second three-dimensional entity model.
If the first polygon is not completely intersected with the second three-dimensional entity model, calculating a plurality of third distances between the intersection point and the plurality of vertexes, and generating a distance set from all the third distances; and obtaining the maximum distance in the distance set, and controlling each vertex in the first polygon to extend the maximum distance along the direction of the normal line to obtain the extended polygon after the first polygon is extended.
In determiningAnd/>Is adjacent to the polygon, from/>Each vertex is along the normal/>Direction generating rays, solving ray and/>Intersection points, when no intersection points exist, indicate that the intersection points are complete, and extension intersection processing is not needed. When some or all of the intersections exist, find the set/>, of the distances from each intersection to the ray originFind the set/>D is the extension distance.
Will beEach vertex edge/>The direction is moved by a distance D to obtain an extended polygon/>。
And step S30, performing extension processing on the first three-dimensional entity model according to the extension polygon to obtain an extension first three-dimensional entity model, and performing incremental merging processing on the extension first three-dimensional entity model and the second three-dimensional entity model to obtain a three-dimensional entity building structure model.
Specifically, updating the first three-dimensional solid model according to coordinate values corresponding to the extended polygon to obtain an extended first three-dimensional solid model after the first three-dimensional solid model is extended;
Combining the second three-dimensional solid model with the extended first three-dimensional solid model according to a construction solid geometry method to obtain a three-dimensional solid model; combining the three-dimensional solid model with a first preset component three-dimensional solid model to obtain an incremental three-dimensional solid model; and merging the increment three-dimensional entity model with a second preset member three-dimensional entity model to obtain the three-dimensional entity building structure model.
As shown in FIG. 4, the basic model S and the component model after the extension process(Update correspondence in model V/>)Coordinates are/>Obtain/>) Merging by constructing solid geometry methods (for S and/>The method comprises the steps of carrying out Boolean operation union to obtain a combined model, providing a Boolean operation module by a CGAL library (a computer geometry algorithm library) to complete the combined model to obtain a combined three-dimensional entity model, combining a plurality of components in an increment mode by the method (the components are V1, V2 and V3, the components are combined to obtain S1, the combination of the S1 and the V3 is obtained to obtain S2, and the S2 is equivalent to the combination of the S1 increment to obtain V3), and modeling a complex three-dimensional entity building structure, wherein the construction of entity geometry is to allow a modeler to create (Boolean operation has intersections, union and difference sets) by combining simpler objects by using Boolean operators, the creation refers to modeling complex surfaces or objects by using the Boolean operation mode, and the combination of some original objects can generate visually complex objects.
Common boolean operations have intersections, union, and difference sets. Intersection refers to the overlapping portion of two geometric objects, and union refers to the result of the merging of two geometric objects, while difference refers to the remainder of one geometric object minus the other geometric object.
In addition, the invention can also be used for setting the combination among the concave component models (the component model combination in the invention is a method belonging to the extension combination of the convex components), the concave components are also arranged in the building structure, such as concave windows in the building structure, the concave components are not intersected, and the Boolean intersection combination problem also exists. The method for combining the extension of the concave component has two points at different places from the method for combining the extension of the convex component, namely, calculating the included angle of a polygonAnd/>Does not need to perform normal inversion operation (pair/>, in the inventionAnd the inverse is performed), and the second is to perform Boolean subtraction by constructing a solid geometry method when constructing a three-dimensional solid model (the invention adopts a Boolean merging mode).
In summary, the present invention provides a method for merging adjacently constructed three-dimensional entities, the method comprising: a first three-dimensional solid model and a second three-dimensional solid model are obtained, the first three-dimensional solid model and the second three-dimensional solid model are decomposed to obtain a first polygon set and a second polygon set, and adjacent searching is carried out in the second polygon set according to any one first polygon in the first polygon set to obtain an adjacent second polygon adjacent to the first polygon; if the first polygon is not completely intersected with the second three-dimensional solid model, the first polygon is subjected to extension processing to obtain an extension polygon; and carrying out extension processing on the first three-dimensional entity model according to the extension polygon to obtain an extension first three-dimensional entity model, and carrying out incremental merging processing on the extension first three-dimensional entity model and the second three-dimensional entity model to obtain a three-dimensional entity building structure model. Decomposing a three-dimensional solid model of a columnar member to obtain a plurality of polygon sets, and carrying out adjacent search on the polygon sets to obtain adjacent polygons; judging whether the three-dimensional solid models of the columnar components are disjoint or not according to the adjacent polygons, if so, performing extension treatment on the three-dimensional solid models of the columnar components to achieve intersection, and performing component merging through the three-dimensional solid models of the intersected columnar components to obtain a merged three-dimensional solid model, so that component merging among the three-dimensional solid models of the disjoint columnar components can be ensured, and the construction of the three-dimensional solid model is facilitated.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or terminal that comprises the element.
Of course, those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by a computer program for instructing relevant hardware (e.g., processor, controller, etc.), the program may be stored on a computer readable storage medium, and the program may include the above described methods when executed. The computer readable storage medium may be a memory, a magnetic disk, an optical disk, etc.
It is to be understood that the invention is not limited in its application to the examples described above, but is capable of modification and variation in light of the above teachings by those skilled in the art, and that all such modifications and variations are intended to be included within the scope of the appended claims.
Claims (8)
1. A method of merging adjacently-constructed three-dimensional entities, the method comprising:
A first three-dimensional solid model and a second three-dimensional solid model are obtained, the first three-dimensional solid model and the second three-dimensional solid model are decomposed to obtain a first polygon set and a second polygon set, and adjacent searching is carried out in the second polygon set according to any one first polygon in the first polygon set to obtain an adjacent second polygon adjacent to the first polygon;
The obtaining a first three-dimensional solid model and a second three-dimensional solid model, decomposing the first three-dimensional solid model and the second three-dimensional solid model to obtain a first polygon set and a second polygon set, and performing adjacent searching in the second polygon set according to any one first polygon in the first polygon set to obtain an adjacent second polygon adjacent to the first polygon, specifically including:
Acquiring a first three-dimensional solid model and a second three-dimensional solid model, decomposing the first three-dimensional solid model to obtain a first polygon set, and decomposing the second three-dimensional solid model to obtain a second polygon set;
Acquiring any one first polygon in the first polygon set and any one second polygon in the second polygon set, and performing adjacent calculation according to the first polygon and the second polygon to obtain an adjacent second polygon adjacent to the first polygon;
And performing adjacent calculation according to the first polygon and the second polygon to obtain an adjacent second polygon adjacent to the first polygon, wherein the method specifically comprises the following steps:
calculating an included angle and a first distance between the first polygon and the second polygon;
when the included angle is smaller than a preset included angle and the first distance is smaller than a preset distance, obtaining a projection polygon of the first polygon on the plane of the second polygon;
When the projection polygon is intersected with the second polygon, judging that the second polygon is an adjacent polygon of the first polygon, and obtaining an adjacent second polygon adjacent to the first polygon;
If the first polygon is not completely intersected with the second three-dimensional solid model, the first polygon is subjected to extension processing to obtain an extension polygon;
And carrying out extension processing on the first three-dimensional entity model according to the extension polygon to obtain an extension first three-dimensional entity model, and carrying out incremental merging processing on the extension first three-dimensional entity model and the second three-dimensional entity model to obtain a three-dimensional entity building structure model.
2. The method of claim 1, wherein when the projected polygon intersects the second polygon, determining the second polygon as an adjacent polygon of the first polygon, and obtaining an adjacent second polygon adjacent to the first polygon, further comprises:
The intersection judgment is carried out on the projection polygon and the second polygon, and when any side of the projection polygon is intersected with the second polygon, the intersection of the projection polygon and the second polygon is judged;
Or when any vertex of the projected polygon is within the range of the second polygon, determining that the projected polygon intersects the second polygon.
3. The method of claim 1, wherein when the projected polygon intersects the second polygon, determining the second polygon as an adjacent polygon of the first polygon, and obtaining an adjacent second polygon adjacent to the first polygon, further comprises:
Calculating a plurality of second distances between the first polygon and a plurality of adjacent polygons when the first polygon corresponds to the adjacent polygons;
And acquiring the adjacent polygons corresponding to the minimum distance values in the second distances, and taking the adjacent polygons corresponding to the minimum distance values as adjacent second polygons of the first polygons.
4. The method of claim 1, wherein if the first polygon does not completely intersect the second three-dimensional solid model, performing extension processing on the first polygon to obtain an extended polygon, further comprising:
Acquiring a normal line of the first polygon, and generating rays along the normal line by each vertex in the first polygon;
and judging whether the ray has an intersection point with the plane of the adjacent second polygon, if so, judging that the first polygon is not completely intersected with the second three-dimensional entity model.
5. The method for merging adjacent three-dimensional solid objects according to claim 4, wherein if the first polygon is not completely intersected with the second three-dimensional solid model, performing extension processing on the first polygon to obtain an extended polygon, and specifically comprising:
if the first polygon is not completely intersected with the second three-dimensional entity model, calculating a plurality of third distances between the intersection point and the plurality of vertexes, and generating a distance set from all the third distances;
and obtaining the maximum distance in the distance set, and controlling each vertex in the first polygon to extend the maximum distance along the direction of the normal line to obtain the extended polygon after the first polygon is extended.
6. The method of claim 4, wherein determining whether the ray intersects a plane of the neighboring second polygon further comprises:
And if the intersection point does not exist between the ray and the plane of the adjacent second polygon, judging that the first polygon is completely intersected with the second three-dimensional entity model.
7. The method for merging adjacent three-dimensional solid structures according to claim 1, wherein the extending the first three-dimensional solid model according to the extended polygon to obtain an extended first three-dimensional solid model, and performing incremental merging on the extended first three-dimensional solid model and the second three-dimensional solid model to obtain a three-dimensional solid building structure model, specifically comprises:
Updating the first three-dimensional solid model according to the coordinate values corresponding to the extended polygon to obtain an extended first three-dimensional solid model after the first three-dimensional solid model is extended;
Combining the second three-dimensional solid model with the extended first three-dimensional solid model according to a construction solid geometry method to obtain a three-dimensional solid model;
and performing incremental merging treatment on the three-dimensional entity model to obtain a three-dimensional entity building structure model.
8. The method for merging adjacent three-dimensional entities of claim 7, wherein the incremental merging of the three-dimensional entity models to obtain a three-dimensional entity building structure model specifically comprises:
combining the three-dimensional solid model with a first preset component three-dimensional solid model to obtain an incremental three-dimensional solid model;
And merging the increment three-dimensional entity model with a second preset member three-dimensional entity model to obtain the three-dimensional entity building structure model.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311800949.5A CN117456115B (en) | 2023-12-26 | 2023-12-26 | Method for merging adjacent three-dimensional entities |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311800949.5A CN117456115B (en) | 2023-12-26 | 2023-12-26 | Method for merging adjacent three-dimensional entities |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117456115A CN117456115A (en) | 2024-01-26 |
| CN117456115B true CN117456115B (en) | 2024-04-26 |
Family
ID=89586013
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311800949.5A Active CN117456115B (en) | 2023-12-26 | 2023-12-26 | Method for merging adjacent three-dimensional entities |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117456115B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB0704368D0 (en) * | 2007-03-07 | 2007-04-11 | Kokkas Nikolaos | Geodata fusion for automated 3D city modelling |
| EP1890267A2 (en) * | 1998-07-16 | 2008-02-20 | The Research Foundation of the State University of New York | Apparatus and method for real-time volume processing and universal 3D rendering |
| CN102663811A (en) * | 2012-03-23 | 2012-09-12 | 北京师范大学 | Real-time three-dimensional visualization method of large-scale scene city building based on spatial cognition |
| CN113112600A (en) * | 2021-04-02 | 2021-07-13 | 浙江大学 | Indoor scene three-dimensional modeling method based on structure |
| CN114707218A (en) * | 2022-04-08 | 2022-07-05 | 广东博智林机器人有限公司 | Three-dimensional model simplification method and device |
-
2023
- 2023-12-26 CN CN202311800949.5A patent/CN117456115B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1890267A2 (en) * | 1998-07-16 | 2008-02-20 | The Research Foundation of the State University of New York | Apparatus and method for real-time volume processing and universal 3D rendering |
| GB0704368D0 (en) * | 2007-03-07 | 2007-04-11 | Kokkas Nikolaos | Geodata fusion for automated 3D city modelling |
| CN102663811A (en) * | 2012-03-23 | 2012-09-12 | 北京师范大学 | Real-time three-dimensional visualization method of large-scale scene city building based on spatial cognition |
| CN113112600A (en) * | 2021-04-02 | 2021-07-13 | 浙江大学 | Indoor scene three-dimensional modeling method based on structure |
| CN114707218A (en) * | 2022-04-08 | 2022-07-05 | 广东博智林机器人有限公司 | Three-dimensional model simplification method and device |
Non-Patent Citations (2)
| Title |
|---|
| Automatic generation of 3D building models from complicated building polygons;Kenichi Sugihara et al.;《Journal of Computing in Civil Engineering》;20120111;第27卷(第5期);第1-7页 * |
| 三维城市模型的构造方法与可视化研究;金宝轩;《中国优秀硕士学位论文全文数据库信息科技辑》;20021215;第1-85页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117456115A (en) | 2024-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sheffer et al. | Robust spherical parameterization of triangular meshes | |
| CN114564772B (en) | Indoor decoration wall installation design method and system based on BIM | |
| US20080297507A1 (en) | Method And Apparatus For Determining Item Orientation | |
| US20240153123A1 (en) | Isogeometric Analysis Method Based on a Geometric Reconstruction Model | |
| CN107657659A (en) | The Manhattan construction method for automatic modeling of scanning three-dimensional point cloud is fitted based on cuboid | |
| CN113724401B (en) | Three-dimensional model cutting method and device, computer equipment and storage medium | |
| JPH0350679A (en) | Method for calculating minkowski's sum of general polyhedron | |
| Kada | 3D building generalization based on half-space modeling | |
| US20210150093A1 (en) | Generating designs for multi-family housing projects using shape parameter transformations | |
| CN115861547B (en) | Model surface spline generating method based on projection | |
| KR20180071928A (en) | Method and system for updating occupancy map based on super ray | |
| Katsoulis et al. | A T-splines-based parametric modeller for computer-aided ship design | |
| CN115758938A (en) | Boundary layer grid generation method for viscous boundary flow field numerical simulation | |
| Han et al. | DiLO: Direct light detection and ranging odometry based on spherical range images for autonomous driving | |
| Huhnt | Reconstruction of edges in digital building models | |
| Niedzwiedzki et al. | Idtmm: Incremental direct triangle mesh mapping | |
| CN105869210A (en) | Interpolation data processing method in three-dimensional geological surface model | |
| CN117456115B (en) | Method for merging adjacent three-dimensional entities | |
| US11763524B2 (en) | Layered meshing for additive manufacturing simulations | |
| Keyser et al. | Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: II—computation | |
| Zhang et al. | Model reconstruction from cloud data | |
| Martínez et al. | Using multicore processors to parallelize 3D point cloud registration with the Coarse Binary Cubes method | |
| JPH1196400A (en) | Shape transforming method | |
| Wiemann et al. | Data handling in large-scale surface reconstruction | |
| CN113763563A (en) | Three-dimensional point cloud geometric grid structure generation method based on plane recognition |
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 |