English

A Duality Transform for Constructing Small Grid Embeddings of 3d Polytopes

Computational Geometry 2016-01-26 v3 Metric Geometry

Abstract

We study the problem of how to obtain an integer realization of a 3d polytope when an integer realization of its dual polytope is given. We focus on grid embeddings with small coordinates and develop novel techniques based on Colin de Verdi\`ere matrices and the Maxwell-Cremona lifting method. We show that every truncated 3d polytope with n vertices can be realized on a grid of size O(n^{9log(6)+1}). Moreover, for every simplicial 3d polytope with n vertices with maximal vertex degree {\Delta} and vertices placed on an L x L x L grid, a dual polytope can be realized on an integer grid of size O(n L^{3\Delta + 9}). This implies that for a class C of simplicial 3d polytopes with bounded vertex degree and polynomial size grid embedding, the dual polytopes of C can be realized on a polynomial size grid as well.

Keywords

Cite

@article{arxiv.1402.1660,
  title  = {A Duality Transform for Constructing Small Grid Embeddings of 3d Polytopes},
  author = {Alexander Igamberdiev and André Schulz},
  journal= {arXiv preprint arXiv:1402.1660},
  year   = {2016}
}

Comments

Full version of the Graph Drawing 2013 conference version, 23 pages, 5 figures

R2 v1 2026-06-22T03:03:34.989Z