Simple and Robust Boolean Operations for Triangulated Surfaces

Abstract

Boolean operations of geometric models is an essential issue in computational geometry. In this paper, we develop a simple and robust approach to perform Boolean operations on closed and open triangulated surfaces. Our method mainly has two stages: (1) We firstly find out candidate intersected-triangles pairs based on Octree and then compute the inter-section lines for all pairs of triangles with parallel algorithm; (2) We form closed or open intersection-loops, sub-surfaces and sub-blocks quite robustly only according to the cleared and updated topology of meshes while without coordinate computations for geometric enti-ties. A novel technique instead of inside/outside classification is also proposed to distinguish the resulting union, subtraction and intersection. Several examples have been given to illus-trate the effectiveness of our approach.

Novel method for determining Union, Subtraction and Intersection

References in corpus (5)

• Fast Tetrahedral Meshing in the Wild
• Topology-Adaptive Mesh Deformation for Surface Evolution, Morphing, and Multi-View Reconstruction
• Topologically robust CAD model generation for structural optimisation
• Indirect predicates for geometric constructions
• Fast Exact Booleans for Iterated CSG using Octree-Embedded BSPs