One-Bend Drawing of $K_n$ in 3D, revisited
Abstract
We present 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; the bend points are also placed at integer grid
points.
The drawing is determined by an incremental algorithm
and the observed behavior of the algorithm
produces an output of volume close to quadratic.
Domains
Computer Science [cs]
Fichier principal
abstract.pdf (639.77 Ko)
Télécharger le fichier
vignette.png (86.4 Ko)
Télécharger le fichier
| Origin | Files produced by the author(s) |
|---|
| Format | Figure, Image |
|---|