Generating triangulations of 2-manifolds
Enumeration in graph theory (05C30) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computational aspects related to convexity (52B55) Triangulating manifolds (57Q15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
[For the entire collection see Zbl 0753.00016.] A triangulation of a 2-manifold \(M\) without boundary is called minimal if every edge is non-shrinkable. Any given triangulation can be obtained from a minimal one by vertex splitting, the inverse operation of edge- shrinking. The author presents an efficient algorithm for shrinking a given triangulation until finally a minimal triangulation is obtained.
- All 2-manifolds have finitely many minimal triangulations
- Minimal triangulations of two-dimensional manifolds
- All orientable 2-manifolds have finitely many minimal triangulations
- A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\)
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- All orientable 2-manifolds have finitely many minimal triangulations
- Hierarchy of surface models and irreducible triangulations.
- A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\)
- Generating even triangulations on the torus
- A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection
- Triangulating submanifolds: an elementary and quantified version of Whitney's method
- Rigidity with few locations
- Irreducible triangulations of surfaces with boundary
- Minimal triangulations of two-dimensional manifolds
- scientific article; zbMATH DE number 125589 (Why is no real title available?)
This page was built for publication: Generating triangulations of 2-manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035762)