Boolean operations on arbitrary polygonal and polyhedral meshes

A linearithmic floating-point arithmetic algorithm designed for solving usual boolean operations (intersection, union, and difference) on arbitrary polygonal and polyhedral meshes is described in this paper. This method does not dis-feature the inputs which can be two volume meshes, two surface meshes or one of each. It provides conformal meshes upon exit. It can be used in many pre- and post-processing applications in computational physics (e.g. cut-cell volume mesh generation or conservative remapping). The core idea is to consider any configuration as a polygonal cloud. The polygons are first triangulated, the intersections are solved, the polyhedral cells are then reconstructed from the conformal triangles cloud and finally their triangular faces are re-aggregated to polygons. This approach offers great flexibility regarding the admissible topologies: non-planar faces, concave faces or cells and some non-manifoldness are handled. The algorithm is described in detail and some current results are shown. A general algorithm to solve boolean operations on arbitrary meshes is proposed.The inputs can be two volume meshes, two surface meshes or one of each.Admissible topologies are numerous; convexity and manifoldness are not required.The inputs can be partially or fully overlapping.The result is a polyhedral or polygonal conformal mesh.

[1]  M. Mehrenberger,et al.  P1‐conservative solution interpolation on unstructured triangular meshes , 2010 .

[2]  Patrick E. Farrell,et al.  Conservative interpolation between volume meshes by local Galerkin projection , 2011 .

[3]  David P. Schmidt,et al.  Conservative interpolation on unstructured polyhedral meshes: An extension of the supermesh approach to cell-centered finite-volume variables , 2011 .

[4]  Jonathan Richard Shewchuk,et al.  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[5]  Jeffrey Grandy,et al.  Conservative Remapping and Region Overlays by Intersecting Arbitrary Polyhedra , 1999 .

[6]  David Eberly,et al.  Triangulation by Ear Clipping , 2016 .

[7]  Mikhail Shashkov,et al.  An efficient linearity and bound preserving conservative interpolation (remapping) on polyhedral meshes , 2007 .

[8]  Christophe Benoit,et al.  Cassiopee: A CFD pre- and post-processing tool , 2015 .

[9]  Mohand Ourabah Benouamer.  Opérations booléennes sur les polyèdres représentés par leurs frontières et imprécisions numériques. (Boolean operations on polyedra represented by their boundaries, and numerical imprecisions) , 1993 .

[10]  Matthijs Douze,et al.  QuickCSG: Arbitrary and Faster Boolean Combinations of N Solids , 2015 .

[11]  Didier Badouel,et al.  Opérations booléennes sur polyèdres : évaluation d'arbres CGS , 1988 .

[12]  David H. Eberly,et al.  3D game engine design - a practical approach to real-time computer graphics , 2000 .

[13]  Len G. Margolin,et al.  Second-order sign-preserving conservative interpolation (remapping) on general grids , 2003 .

[14]  Frédéric Alauzet,et al.  A parallel matrix-free conservative solution interpolation on unstructured tetrahedral meshes , 2016 .

[15]  Paul-Louis George,et al.  ASPECTS OF 2-D DELAUNAY MESH GENERATION , 1997 .

[16]  Sâm Landier.  Boolean Operations on Arbitrary Polyhedral Meshes , 2015 .

[17]  Pierre Brenner.  Three-dimensional aerodynamics with moving bodies applied to solid propellant , 1991 .

[18]  Young Choi,et al.  Boolean set operations on non-manifold boundary representation objects , 1991, Comput. Aided Des..

[19]  Matthew D. Piggott,et al.  Conservative interpolation between unstructured meshes via supermesh construction , 2009 .

[20]  Martin Held,et al.  Efficient and reliable triangulation of polygons , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).