z-logo
open-access-imgOpen Access
1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved
Author(s) -
Thérèse Biedl
Publication year - 2001
Publication title -
journal of graph algorithms and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00034
Subject(s) - computer science , mathematics , combinatorics , geometry
This paper studies three-dimensional orthogonal box-drawings where edge-routes have at most one bend. Two open problems for such drawings are: (1) Does every drawing of Kn have volume (n 3 )? (2) Is there a drawing of Kn for which additionally the vertices are represented by cubes with surface O(n)? This paper answers both questions in the negative, and provides related results concerning volume bounds as well.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom