ISSN:
1432-0541
Keywords:
Graph drawing
;
Proximity graphs
;
Delaunay triangulation
;
Gabriel graph
;
Relative neighborhood graph
;
Relatively closest graph
;
Minimum spanning tree
;
Trees
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Complete characterizations are given for those trees that can be drawn as either the relative neighborhood graph, relatively closest graph, Gabriel graph, or modified Gabriel graph of a set of points in the plane. The characterizations give rise to linear-time algorithms for determining whether a tree has such a drawing; if such a drawing exists one can be constructed in linear time in the real RAM model. The characterization of Gabriel graphs settles several conjectures of Matula and Sokal [17].
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02086609
Permalink