QuickCSG: Fast Arbitrary Boolean Combinations of N Solids

Matthijs Douze 1, 2 Jean-Sébastien Franco 1 Bruno Raffin 3, 4
1 MORPHEO - Capture and Analysis of Shapes in Motion
Inria Grenoble - Rhône-Alpes, LJK - Laboratoire Jean Kuntzmann, INPG - Institut National Polytechnique de Grenoble
Abstract : 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.
Type de document :
Rapport
[Research Report] ArXiv. 2017
Liste complète des métadonnées

https://hal.inria.fr/hal-01587902
Contributeur : Jean-Sébastien Franco <>
Soumis le : jeudi 14 septembre 2017 - 17:40:57
Dernière modification le : vendredi 29 septembre 2017 - 19:50:50

Fichier

1706.01558.quickcsg.archiv.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité - Pas d'utilisation commerciale - Pas de modification 4.0 International License

Identifiants

  • HAL Id : hal-01587902, version 1

Collections

Citation

Matthijs Douze, Jean-Sébastien Franco, Bruno Raffin. QuickCSG: Fast Arbitrary Boolean Combinations of N Solids. [Research Report] ArXiv. 2017. 〈hal-01587902〉

Partager

Métriques

Consultations de
la notice

61

Téléchargements du document

8