Surface set mutual cutting method and system based on space scanning

Abstract

The invention discloses a surface set mutual cutting method and system based on space scanning. The method and system provide users a technique for efficiently realizing mutual cutting of a lot of surfaces, can finish multiple steps of triangular intersection detection, memory scheduling, re-triangulation and generation of result surface patches and the like in a single scanning process, and can overcome the inconsistency problems of multi-surface common point, collineation, coplane and self-intersection and the like in pairwise cutting calculation; through a plurality of modes of flow loading, maintaining triangles interacting with a scanning plane, generating and storing finished surface patches as soon as possible and freeing memory occupied by the surface patches and the like, data volume involved in calculation is reduced, and calculation scale is reduced; and in the cutting process, calculation in each step no longer depends on the result that all data in the previous step is processed, and the steps can be processed in parallel, and thus the method and system are especially suitable for high-performance calculating environment.

Description

technical field [0001] The invention relates to a three-dimensional curved surface cutting technology, in particular, a method and system for realizing mutual cutting of curved surface sets based on space scanning. Background technique [0002] With the development of surveying and mapping technology and 3D modeling technology, people gradually have the conditions to construct various complex and fine 3D object models. The construction of these three-dimensional surface object models often involves cutting a large number of three-dimensional surfaces, and then eliminating redundant parts and kneading different surfaces into a whole. Generally, the idea of ​​completing the mutual cutting of three-dimensional surfaces is: construct a separate index for each surface, and then perform intersection calculations in pairs. During the calculation process, the index is used to accelerate the triangle collision detection, and the intersection line is traced from a detected intersectio...

AI Technical Summary

Problems solved by technology

[0003] (1) Cutting calculations are performed in pairs, and inconsistencies are likely to occur when multiple surfaces pass through and intersect at the same point in space;

[0004] (2) If a triangular patch intersects multiple surfaces, the triangular patch will undergo multiple re-triangulation through multiple rounds of pairwise cutting, and the triangulation process is affected by the cutting order, which may result in a non-globally optimal solution ;

[0005] (3) It is difficult to find the self-intersection phenomenon existing in the same surface by only judging the intersection of triangular patches from different surfaces;

[0006] (4) N three-dimensional surfaces need to perform N*(N-1) / 2 pairwise cutting calculations, and the calculation scale may become very large;

[0007] (5) The generation of the result patch needs to be completed at the end of the pairwise intersection process. Only at this time can it be guaranteed that all intersecting triangles have been processed. When the data volume of a single surface is large, a large amount of memory will be consumed;

[0008] (6) Although pairwise cutting calculations between a large number of surfaces can be used as a basic computing unit to support parallel calculations, the surface data structure needs to support parallel operations. When the same surface is processed in parallel, it is necessary to coordinate the consistency relationship in the cutting process. However, each parallel unit corresponds to a complete cutting process, and consistency maintenance is quite difficult

Images