The Strength of Weak Proximity (Extended Abstract)

Di Battista, Giuseppe and Liotta, Giuseppe and Whitesides, Sue (1996) The Strength of Weak Proximity (Extended Abstract). In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , Passau, Germany , pp. 178-189 (Official URL: http://dx.doi.org/10.1007/BFb0021802).

Full text not available from this repository.

Abstract

This paper initiates the study of weak proximity drawings of graphs and demonstrates their advantages over strong proximity drawings in certain cases. Weak proximity drawings are straight line drawings such that if the proximity region of two points p and q representing vertices is devoid of other points representing vertices, then segment (p,q) is allowed, but not forced, to appear in the drawing. This differs from the usual, strong, notion of proximity drawing in which such segments must appear in the drawing. Most previously studied proximity regions are associated with a parameter \beta, 0\le\beta\le\infty. For fixed \beta, weak \beta-drawability is at least as expressive as strong \beta-drawability, as a strong \beta-drawing is also a weak one. We give examples of graph families and \beta values where the two notions coincide, and a situation in which it is NP-hard to determine weak \beta-drawability. On the other hand, we give situations where weak proximity significantly increases the expressive power of \beta-drawability: we show that every graph has, for all sufficiently small \beta, a weak \beta-proximity drawing that is computable in linear time, and we show that every tree has, for every \beta less than 2, a weak \beta-drawing that is computable in linear time.

Item Type:Conference Paper
Additional Information:10.1007/BFb0021802
Classifications:P Styles > P.720 Straight-line
G Algorithms and Complexity > G.999 Others
ID Code:124

Repository Staff Only: item control page

References

S. Bhatt and S. Cosmadakis. The Complexity of Minimizing Wire Lengths in VLSI Layouts. Information Processing Letters, 25, 1987, pp.263-267.

P. Bose, W. Lenhart, and G. Liotta. Characterizing Proximity Trees. Algorithmica, Special Issue on Graph Drawing (to appear).

P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity Constraints and Representable Trees. Graph Drawing, Proc. of the DIMACS International Workshop GD94, New Jersey, USA, October 1994, LNCS 894, R. Tamassia and I.G. Tollis eds., Springer-Verlag, 1995, pp.340-351.

G. Di Battista, W. Lenhart, and G. Liotta. Proximity Drawability: a Survey. Graph Drawing, Proc. of the DIMACS International Workshop GD94, New Jersey, USA, October 1994, LNCS 894, R. Tamassia and I.G. Tollis eds., Springer-Verlag, 1995, pp.328-339.

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

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.

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.

M. Ichino and J. Sklansky. The Relative Neighborhood Graph for Mixed Feature Variables. Pattern Recognition, 18, 1985, pp. 161-167.

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.

J.M. Keil. Computing a Subgraph of the Minimum Weight Triangulation. Comp. Geom.: Theory and Appl., 4, 1994, pp. 13-26.

D.G. Kirkpatrick and J.D. Radke. A Framework for Computational Morphology. Computational Geometry, ed. G.T. Toussaint, Elsevier, Amsterdam, 1985, pp.217-248.

A. Lubiw and N. Sleumer. All Maximal Outerplanar Graphs are Relative Neighborhood Graphs. Proc. 5th CCCG, Waterloo, 1993, pp. 198-203.

S. Malitz and A. Papakostas. On the Angular Resolution of Planar Graphs. Proc. STOC, 1993, pp. 431-437.

W. Schnyder. Embedding Planar Graphs on the Grid. Proc. SODA, 1990, pp.41-51.

R. Tamassia and I.G. Tollis. A Unified Approach to Visibility Representations of Planar Graphs. Discr. and Comp. Geometry, 1, 1986, pp. 321-341.

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.