Advancing Front Mapping

by   Marco Livesu, et al.

We present Advancing Front Mapping (AFM), a provably robust algorithm for the computation of surface mappings to simple base domains. Given an input mesh and a convex or star-shaped target domain, AFM installs a (possibly refined) version of the input connectivity into the target shape, generating a piece-wise linear mapping between them. The algorithm is inspired by the advancing front meshing paradigm, which is revisited to operate on two embeddings at once, thus becoming a tool for compatible mesh generation. AFM extends the capabilities of existing robust approaches, such as Tutte or Progressive Embedding, by providing the same theoretical guarantees of injectivity and at the same time introducing two key advantages: support for a broader set of target domains (star-shaped polygons) and local mesh refinement, which is used to automatically open the space of solutions in case a valid mapping to the target domain does not exist. AFM relies solely on two topological operators (split and flip), and on the computation of segment intersections, thus permitting to compute provably injective mappings without solving any numerical problem. This makes the algorithm predictable, easy to implement, debug and deploy. We validated the capabilities of AFM extensively, executing more than one billion advancing front moves on 36K mapping tasks, proving that our theoretical guarantees nicely transition to a robust and practical implementation.


page 1

page 6

page 7

page 8

page 10

page 12


Mapping Surfaces with Earcut

Mapping a shape to some parametric domain is a fundamental tool in graph...

Estimation of the continuity constants for Bogovskiĭ and regularized Poincaré integral operators

We study the dependence of the continuity constants for the regularized ...

NAM: Non-Adversarial Unsupervised Domain Mapping

Several methods were recently proposed for the task of translating image...

VoroCrust: Voronoi Meshing Without Clipping

Polyhedral meshes are increasingly becoming an attractive option with pa...

Simulation and Optimization of Mean First Passage Time Problems in 2-D using Numerical Embedded Methods and Perturbation Theory

We develop novel numerical methods and perturbation approaches to determ...

Foldover-free maps in 50 lines of code

Mapping a triangulated surface to 2D space (or a tetrahedral mesh to 3D ...

Please sign up or login with your details

Forgot password? Click here to reset