QuickCSG: Fast Arbitrary Boolean Combinations of N Solids

by   Matthijs Douze, et al.

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.



There are no comments yet.


page 1

page 3

page 12

page 14

page 17

page 20

page 21

page 22


K-Clique Counting on GPUs

Counting k-cliques in a graph is an important problem in graph analysis ...

iPregel: Strategies to Deal with an Extreme Form of Irregularity in Vertex-Centric Graph Processing

Over the last decade, the vertex-centric programming model has attracted...

iPregel: Vertex-centric programmability vs memory efficiency and performance, why choose?

The vertex-centric programming model, designed to improve the programmab...

Functional Synthesis via Input-Output Separation

Boolean functional synthesis is the process of constructing a Boolean fu...

Generalized bent Boolean functions and strongly regular Cayley graphs

In this paper we define the (edge-weighted) Cayley graph associated to a...

Boolean Operations using Generalized Winding Numbers

The generalized winding number function measures insideness for arbitrar...

An Algorithm for the Exact Treedepth Problem

We present a novel algorithm for the minimum-depth elimination tree prob...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.