Published in

Springer, Lecture Notes in Computer Science, p. 83-88, 2006

DOI: 10.1007/11618058_8

Brown University, Journal of Graph Algorithms and Applications, 2(10), p. 287-295

DOI: 10.7155/jgaa.00128

Links

Tools

Export citation

Search in Google Scholar

Drawing Kn in Three Dimensions with One Bend per Edge

Journal article published in 2006 by Olivier Devillers ORCID, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen Wismath
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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)$.