HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Drawing Kn in Three Dimensions with One Bend per Edge

Olivier Devillers 1 Hazel Everett 2 Sylvain Lazard 2 Maria Pentcheva 2 Steve Wismath 3
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
2 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We give a drawing of Kn 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})$.
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

Contributor : Sylvain Lazard Connect in order to contact the contributor
Submitted on : Monday, November 19, 2007 - 5:40:29 PM
Last modification on : Thursday, January 20, 2022 - 4:16:34 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 6:30:33 PM


Files produced by the author(s)


  • HAL Id : inria-00103923, version 1



Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Steve Wismath. Drawing Kn in Three Dimensions with One Bend per Edge. Journal of Graph Algorithms and Applications, Brown University, 2006, 10 (2), pp.287-295. ⟨inria-00103923⟩



Record views


Files downloads