Drawing 3Polytopes with Good Vertex ResolutionSchulz , André (2010) Drawing 3Polytopes with Good Vertex Resolution. In: Graph Drawing 17th International Symposium, GD 2009, September 2225, 2009 , pp. 3344(Official URL: http://dx.doi.org/10.1007/9783642118050_6). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783642118050_6
AbstractWe study the problem how to obtain a small drawing of a 3polytope with Euclidean distance between any two points at least 1. The problem can be reduced to a onedimensional problem, since it is suﬃcient to guarantee distinct integer xcoordinates. We develop an algorithm that yields an embedding with the desired property such that the polytope is contained in a 2(n − 2) × 1 × 1 box. The constructed embedding can be scaled to a grid embedding whose xcoordinates are contained in [0, 2(n − 2)]. Furthermore, the point set of the embedding has a small spread, which differs from the best possible spread only by a multiplicative constant.
Actions (login required)
