166 citations · 359 across the 14 of their papers we have counts for
5 papers · 1 filter
Constrained Delaunay Tetrahedrization: A Robust and Practical Approach
Lorenzo Diazzi, Daniele Panozzo, Amir Vaxman +1
We present a numerically robust algorithm for computing the constrained Delaunay tetrahedrization (CDT) of a piecewise-linear complex, which has a 100% success rate on the 4408 val…
Interactive and Robust Mesh Booleans
Gianmarco Cherchi, Fabio Pellacini, Marco Attene +1
Boolean operations are among the most used paradigms to create and edit digital shapes. Despite being conceptually simple, the computation of mesh Booleans is notoriously challengi…
Indirect predicates for geometric constructions
Marco Attene
Geometric predicates are a basic ingredient to implement a vast range of algorithms in computational geometry. Modern implementations employ floating point filtering techniques to…
Deterministic Linear Time Constrained Triangulation using Simplified Earcut
Marco Livesu, Gianmarco Cherchi, Riccardo Scateni +1
Triangulation algorithms that conform to a set of non-intersecting input segments typically proceed in an incremental fashion, by inserting points first, and then segments. Inserti…
Epsilon-shapes: characterizing, detecting and thickening thin features in geometric models
Daniela Cabiddu, Marco Attene
We focus on the analysis of planar shapes and solid objects having thin features and propose a new mathematical model to characterize them. Based on our model, that we call an epsi…