QuickCSG: Fast Arbitrary Boolean Combinations of N Solids - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2017

QuickCSG: Fast Arbitrary Boolean Combinations of N Solids


QuickCSG computes the result for general N-polyhedron boolean expressions without an intermediate tree of solids. We propose a vertex-centric view of the problem, which simplifies the identification of final geometric contributions, and facilitates its spatial decomposition. The problem is then cast in a single KD-tree exploration, geared toward the result by early pruning of any region of space not contributing to the final surface. We assume strong regularity properties on the input meshes and that they are in general position. This simplifying assumption, in combination with our vertex-centric approach, improves the speed of the approach. Complemented with a task-stealing parallelization, the algorithm achieves breakthrough performance, one to two orders of magnitude speedups with respect to state-of-the-art CPU algorithms, on boolean operations over two to dozens of polyhedra. The algorithm also outperforms GPU implementations with approximate discretizations, while producing an output without redundant facets. Despite the restrictive assumptions on the input, we show the usefulness of QuickCSG for applications with large CSG problems and strong temporal constraints, e.g. modeling for 3D printers, reconstruction from visual hulls and collision detection.
Fichier principal
Vignette du fichier
1706.01558.quickcsg.archiv.pdf (7.4 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01587902 , version 1 (14-09-2017)


Attribution - NonCommercial - NoDerivatives


  • HAL Id : hal-01587902 , version 1


Matthijs Douze, Jean-Sébastien Franco, Bruno Raffin. QuickCSG: Fast Arbitrary Boolean Combinations of N Solids. [Research Report] ArXiv. 2017. ⟨hal-01587902⟩
663 View
1450 Download


Gmail Facebook X LinkedIn More