166 citations · 371 across the 16 of their papers we have counts for
4 papers · 1 filter
Mapping Surfaces with Earcut
Marco Livesu
Mapping a shape to some parametric domain is a fundamental tool in graphics and scientific computing. In practice, a map between two shapes is commonly represented by two meshes wi…
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…
A Survey of Algorithms for Geodesic Paths and Distances
Keenan Crane, Marco Livesu, Enrico Puppo +1
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry…
Obtaining a Canonical Polygonal Schema from a Greedy Homotopy Basis with Minimal Mesh Refinement
Marco Livesu
Any closed manifold of genus g can be cut open to form a topological disk and then mapped to a regular polygon with 4g sides. This construction is called the canonical polygonal sc…