We introduce a novel algorithm to transform any generic set of triangles in 3D space into a
well-formed simplicial complex. Intersecting elements in the input are correctly identified …

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 …

We consider the fundamental problem of injectively mapping a surface mesh with disk
topology onto a boundary constrained convex domain. We start from the basic observation …

We present an exact implementation of an efficient algorithm that computes Minkowski sums
of convex polyhedra in R3. Our implementation is complete in the sense that it does not …

The international standards for geographic information provide unambiguous definitions of
geometric primitives, with the aim of fostering exchange and interoperability in the …

Balls and spheres are amongst the simplest 3 D modeling primitives, and computing the
volume of a union of balls is an elementary problem. Although a number of strategies …

Geometric predicates are a basic ingredient to implement a vast range of algorithms in
computational geometry. Modern implementations employ floating point filtering techniques …

Arrangements of curves constitute fundamental structures that have been intensively studied
in computational geometry. Arrangements have numerous applications in a wide range of …

Abstract The Art Gallery Problem (AGP) is one of the most well-known problems in
Computational Geometry (CG), with a rich history in the study of algorithms, complexity, and …

Minkowski sum is an important operation. It is used in many domains such as: computer-
aided design, robotics, spatial planning, mathematical morphology, and image processing …