scientific article; zbMATH DE number 176586
From MaRDI portal
Publication:4035762
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computational aspects related to convexity (52B55) Enumeration in graph theory (05C30) Triangulating manifolds (57Q15)
Recommendations
- 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
Cited in
(10)- Rigidity with few locations
- scientific article; zbMATH DE number 125589 (Why is no real title available?)
- Triangulating submanifolds: an elementary and quantified version of Whitney's method
- Generating even triangulations on the torus
- Minimal triangulations of two-dimensional manifolds
- Hierarchy of surface models and irreducible triangulations.
- A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\)
- Irreducible triangulations of surfaces with boundary
- All orientable 2-manifolds have finitely many minimal triangulations
- A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035762)
