The strength of weak proximity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1027, Issue , 1996, Pages 178-189

  Di Battista, Giuseppe ^a   Liotta, Giuseppe ^b   Whitesides, Sue ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b Brown Univerity   (United States)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

DRAWABILITY; EXPRESSIVE POWER; LINEAR TIME; NP-HARD; PROXIMITY DRAWING; STRAIGHT-LINE DRAWINGS; TWO-POINT;

TREES (MATHEMATICS);

EID: 84947911810     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021802     Document Type: Conference Paper

References (16)

1. S. Bhatt and S. Cosmadakis. The Complexity of Minimizing Wire Lengths in VLSI Layouts. Information Processing Letters, 25, 1987, pp. 263-267.
2. P. Bose, W. Lenhart, and G. Liotta. Characterizing Proximity Trees. Algorithmica, Special Issue on Graph Drawing (to appear).
3. P. Bose, G. Di Battista, W.Lenhart, sind G. Liotta. Proximity Constraints and Representable Trees. Graph Drawing, Proc. of the DIM ACS International Workshop GD94, New Jersey, USA, October 1994, LNCS 894,R. Tamassia and I.G. Tollis eds., Springer-Verlag, 1995, pp. 340-351.
4. G. Di Battista, W. Lenhart, and G. Liotta. Proximity Drawability: a Survey. Graph Drawing, Proc. of the DIMAGS International Workshop GD94, New Jersey, USA, October 1994, LNCS 894, R. Tamassia and I.G. Tollis eds., Springer-Verlag, 1995, pp. 328-339.
5. G. Di Battista, R. Tamassia, and I. G. Tollis. Area Requirement and Symmetry Display of Planar Upward Drawings. Discr. and Comp. Geometry, 7,1992, pp. 381-401.
6. P. Eades and S. Whitesides. The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. Proc. 10th ACM Symposium on Computational Geometry, 1994, pp. 49-56.
7. P. Eades and S. Whitesides. Nearest Neighbor Graph Realizability is NP-hard. Proc. Latin'95, Valparaiso, Chile, 1995, LNCS 911,R. Baeza-Yates, E. Goles, P. Poblete eds., Springer-Verlag, 1995, pp. 245-256.
8. M. Ichino and J. Sklansky. The Relative Neighborhood Graph for Mixed Feature Variables. Pattern Recognition, 18,1985, pp. 161-167.
9. G. Kant, G. Liotta, R. Tamassia, and I.G. Tollis. Area Requirement of Visibility Representations of Trees. Proc.5th CCCG, Waterloo, 1993, pp. 192-197.
10. J.M. Keil. Computing a Subgraph of the Minimum Weight Triangulation. Comp. Geom.: Theory and Appl., 4,1994, pp. 13-26.
11. D. G. Kirkpatrick and J. D. Radke. A Framework for Computational Morphology. Computational Geometry, ed. G. T. Toussaint, Elsevier, Amsterdam, 1985, pp. 217-248.
12. A. Lubiw and N. Sleumer. All Maximal Outerplanar Graphs are Relative Neighborhood Graphs. Proc. 5th CCCG, Waterloo, 1993, pp. 198-203.
13. S. Malitz and A. Papakostas. On the Angular Resolution of Planar Graphs. Proc. STOC, 1993, pp. 431-437.
14. W. Schnyder. Embedding Planar Graphs on the Grid. Proc. SODA, 1990, pp. 41-51.
15. R. Tamassia and I. G. Tollis. A Unified Approach to Visibility Representations of Planar Graphs. Discr. and Comp. Geometry, 1, 1986, pp. 321-341.
16. M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Simvonis, E. Welzl, G. Woeginger. Drawing Graphs in the Plane with High Resolution. Proc. FOCS, 1990, pp. 86-95.