Triangulating submanifolds: An elementary and quantified version of Whitney's method

Jean-Daniel Boissonnat (1, 2) , Siargey Kachanovich (2, 1) , Mathijs Wintraecken (2, 1)

1 CRISAM - Inria Sophia Antipolis - Méditerranée
2 DATASHAPE - Understanding the Shape of Data

We quantize Whitney's construction to prove the existence of a triangulation for any C2 manifold, so that we get an algorithm with explicit bounds. We also give a new elementary proof, which is completely geometric.

Mots clés: Triangulations; Manifolds; Coxeter triangulations

Domaines: Géométrie algorithmique [cs.CG]; Algorithme et structure de données [cs.DS]; Topologie algébrique [math.AT]; Topologie géométrique [math.GT]

Jean-Daniel Boissonnat, Siargey Kachanovich, Mathijs Wintraecken. Triangulating submanifolds: An elementary and quantified version of Whitney's method. 2018. ⟨hal-01950149v1⟩