Triangulating submanifolds: An elementary and quantified version of Whitney's method
| Autor: | Mathijs Wintraecken, Siargey Kachanovich, Jean-Daniel Boissonnat |
|---|---|
| Přispěvatelé: | Understanding the Shape of Data (DATASHAPE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), Université Côte d'Azur (UCA), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), European Project: 339025,EC:FP7:ERC,ERC-2013-ADG,GUDHI(2014), European Project: 754411,ISTplus(2017) |
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: |
Triangulation (topology)
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] 0102 computer and information sciences [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG] 01 natural sciences Mathematics::Geometric Topology Manifold Theoretical Computer Science Combinatorics Algebra 010104 statistics & probability Coxeter triangulations Computational Theory and Mathematics 010201 computation theory & mathematics [MATH.MATH-AT]Mathematics [math]/Algebraic Topology [math.AT] [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT] Elementary proof Discrete Mathematics and Combinatorics Geometry and Topology 0101 mathematics Triangulations Manifolds Mathematics |
| Popis: | We quantise Whitney’s construction to prove the existence of a triangulation for any$$C^2$$C2manifold, so that we get an algorithm with explicit bounds. We also give a new elementary proof, which is completely geometric. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|