We present an algorithm for robust Boolean operations of triangulated solids, which is suitable for real-word industrial applications involving meshes with large numbers of triangles. In order to avoid potential robustness problems, which may be caused by (almost) degenerate triangles or by intersections of nearly co-planar triangles, we use filtered exact arithmetic, based on the libraries CGAL and GNU Multi Precision Arithmetic Library. The method consists of two major steps: First we compute the exact intersection of the meshes using a sweep plane algorithm. Second we apply mesh cleaning methods which allow us to generate output which can safely be represented using floating point numbers. The performance of the method is demonstrated by several examples which are taken from applications at ECS Magna Powertrain.
Aiming at robustness of Boolean operations for large number of triangles in industrial applications, Schifko et al. REF adopt several suitable libraries from CGAL and GNU multi precision arithmetic library to filter exact arithmetic.
Industrial application of exact Boolean operations for meshes
Proceedings of the 26th Spring Conference on Computer Graphics - SCCG '10
Proceedings of the 26th Spring Conference on Computer Graphics - SCCG '10
Computer Science