46 search results - page 1 / 10 » Area Requirement of Gabriel Drawings |
CIAC
1997
Springer
13 years 9 months ago
1997
Springer
d abstract) G. Liotta1, R. Tamassia2, I. G. Tollis3, P. Vocca4 1 Dipartimento di Informatica e Sistemistica, Universita di Roma \La Sapienza", via Salaria 113, 00198 Rome, Ita...
COMGEO
2004
ACM
13 years 5 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
GD
1997
Springer
13 years 9 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
CCCG
2007
13 years 6 months ago
2007
We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjectur...
ACSC
2004
IEEE
13 years 9 months ago
2004
IEEE
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...