pith. sign in

arxiv: 1402.1660 · v3 · pith:D4A3DPS5new · submitted 2014-02-07 · 💻 cs.CG · math.MG

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

classification 💻 cs.CG math.MG
keywords gridpolytopesizedualintegerpolytopesrealizedvertices
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.