Surface realization with the intersection edge functional
arXiv:math/0608538 · doi:10.1016/j.ejc.2008.12.016
Abstract
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a heuristic algorithm for the realization of simplicial maps, based on the intersection edge functional. The heuristic was used to find geometric realizations in R^3 for all vertex-minimal triangulations of the orientable surfaces of genus g=3 and g=4. Moreover, for the first time, examples of simplicial polyhedra in R^3 of genus 5 with 12 vertices were obtained.
22 pages, 11 figures, various minor revisions, to appear in Experimental Mathematics
References in corpus (13)
- Ricci flow with surgery on three-manifolds
- Finite extinction time for the solutions to the Ricci flow on certain three-manifolds
- Triangulated Manifolds with Few Vertices: Combinatorial Manifolds
- Combinatorial 3-manifolds with 10 vertices
- Irreducible triangulations of low genus surfaces
- Generating irreducible triangulations of surfaces
- Triangulated Manifolds with Few Vertices: Vertex-Transitive Triangulations I
- A note on the existence of {k, k}-equivelar polyhedral maps
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Polyhedra of genus 2 with 10 vertices and minimal coordinates
- Polyhedral Surfaces in Wedge Products
- Non-Realizable Minimal Vertex Triangulations of Surfaces: Showing Non-Realizability using Oriented Matroids and Satisfiability Solvers
- Knotted Polyhedral Tori