Drawing K_n in Three Dimensions with One Bend per Edge

Devillers, Olivier and Everett, Hazel and Lazard, Sylvain and Pentcheva, Maria and Wismath, Stephen (2006) Drawing K_n in Three Dimensions with One Bend per Edge. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 83-88(Official URL: http://dx.doi.org/10.1007/11618058_8).

Full text not available from this repository.

Abstract

We give a drawing of K_n in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by O(n^{2.5}). This represents a significant improvement over previous drawings in this model.

Item Type: Conference Paper
Additional Information: 10.1007/11618058_8
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.210 Bends
P Styles > P.060 3D
URI: http://gdea.informatik.uni-koeln.de/id/eprint/682

Actions (login required)

View Item View Item