2006/08/31 by Stefan Hougardy, T. Sulanke, Frank H. Lutz +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Computational Geometry and Mesh Generation #Geometric and Algebraic Topology #math.CO #math.MG #msc:52B70 #msc:57Q15
paper · pdf · doi:10.1016/j.ejc.2008.12.016
22 pages, 11 figures, various minor revisions, to appear in Experimental Mathematics
openalex publication_date 2009/01/14 · arxiv created 2009/05/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31
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 R3 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 R3 of genus 5 with 12 vertices were obtained.