Mapping Surfaces with Earcut
Marco Livesu

TL;DR
This paper introduces a novel mesh generation approach for shape mapping that considers connectivity as an unknown, enabling robust and simple algorithms for planar shape parameterization and potential volumetric extensions.
Contribution
It presents a new perspective on mesh parameterization by treating connectivity as an unknown and using mesh growth from boundaries, bridging mesh generation and shape mapping.
Findings
Provides a robust algorithm for planar shape mapping with simple topology.
Recovers a weakly visible homotopic domain from boundary inputs.
Discusses challenges and prospects for volumetric map extension.
Abstract
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 with same connectivity and different embedding. The standard approach is to input a meshing of one of the two domains plus a function that projects its boundary to the other domain, and then solve for the position of the interior vertices. Inspired by basic principles in mesh generation, in this paper we present the reader a novel point of view on mesh parameterization: we consider connectivity as an additional unknown, and assume that our inputs are just two boundaries that enclose the domains we want to connect. We compute the map by simultaneously growing the same mesh inside both shapes.This change in perspective allows us to recast the parameterization problem as a mesh generation problem, granting access…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputer Graphics and Visualization Techniques · Computational Geometry and Mesh Generation · 3D Shape Modeling and Analysis
