Surface realization with the intersection edge functional
| dc.creator | Hougardy, Stefan | |
| dc.creator | Lutz, Frank H. | |
| dc.creator | Zelke, Mariano | |
| dc.date | 2006-08-22 | |
| dc.date | 2009-05-13 | |
| dc.date.accessioned | 2026-07-07T13:14:13Z | |
| dc.date.available | 2026-07-07T13:14:13Z | |
| dc.description | 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. | |
| dc.description | 22 pages, 11 figures, various minor revisions, to appear in Experimental Mathematics | |
| dc.identifier | https://arxiv.org/abs/math/0608538 | |
| dc.identifier | http://arxiv.org/abs/math/0608538 | |
| dc.identifier | doi:10.1016/j.ejc.2008.12.016 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230139 | |
| dc.subject | Metric Geometry | |
| dc.subject | Combinatorics | |
| dc.subject | 52B70; 57Q15 | |
| dc.title | Surface realization with the intersection edge functional | |
| dc.type | text |