Abstract
In this paper, we show the inclusion relation among several constrained geometric structures. In particular, we examine the constrained relative neighborhood graph in relation with other constrained geometric structures such as the constrained minimum spanning tree, constrained Gabriel graph, straight-line dual of bounded Voronoi diagram and the constrained Delaunay triangulation. We modify a linear time algorithm for computing the relative neighborhood graph from the Delaunay triangulation and show that the constrained relative neighborhood graph can also be computed in linear-time from the constrained Delaunay triangulation in the (ℜ 2, L p ) metric space.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Aurenhammer, “Voronoi Diagrams — A Survey of a Fundamental Geometric Data Structure”, ACM Comp. Surveys, Vol. 23, No. 3, Sep. 1991, pp. 345–406.
L. P. Chew, “Constrained Delaunay Triangulations”, Algorithmica 4 (1989), pp. 97–108.
H. N. Gabow and R. E. Tarjan, “A Linear-Time Algorithm for a Special Case of Disjoint Set Union”, Journal of Computer and System Sciences 30, 1985, pp. 209–221.
K. R. Gabriel and R. R. Sokal, “A New Statistical Approach to Geographic Variation Analysis”, Systematic Zoology 18 (1969), pp. 259–278.
J. W. Jaromczyk and M. Kowaluk, “A Note on Relative Neighborhood Graphs”, Proceedings of the 3rd Annual Symposium on Computational Geometry, Waterloo, Canada, 1987, pp. 233–241.
J. W. Jaromczyk, M. Kowaluk and F. F. Yao, “An Optimal Algorithm for Constructing Β-skeletons in L p Metric”, (manuscript, 1992) to appear in the SIAM Journal of Computing.
D. T. Lee and A. K. Lin, “Generalized Delaunay Triangulation for Planar Graphs”, Discrete and Computational Geometry, 1 (1986), pp. 201–217.
A. Lingas, “Voronoi Diagrams with Barriers and the Shortest Diagonal Problem”, Information Processing Letters 32 (1989), pp. 191–198.
A. Lingas, “A Simple Linear-Time Algorithm for Constructing the Relative Neighborhood Graph from the Delaunay Triangulation”, 1992, (submitted).
F. P. Preparata and M. I. Shamos, “Computational Geometry, An Introduction”, Springer-Verlag, 1985.
R. Seidel, “Constrained Delaunay Triangulations and Voronoi Diagrams with Obstacles”, In Rep. 260, IIG-TU, Graz, Australia, 1988, pp. 178–191.
T. H. Su and R. C. Chang, “Computing the Constrained Relative Neighborhood Graphs and Constrained Gabriel Graphs in Euclidean Plane”, Pattern Recognition, Vol. 24, No. 3, 1991, pp. 221–230.
K. J. Supowit, “The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees”, J. of Assoc. for Comput. Mach. Vol. 30, No. 3, July 1983, pp. 428–448.
G. Toussaint, “The Relative Neighborhood Graph of a Finite Planar Set”, Pattern Recognition, Vol. 12 (1979), pp. 261–268.
C. A. Wang and L. Schubert, “An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments”, Proceedings of the 3rd Annual Symposium on Computational Geometry, June 8–10, 1987, Waterloo, Ontario, Canada, pp. 223–232.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jennings, E., Lingas, A. (1992). On the relationships among constrained geometric structures. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_82
Download citation
DOI: https://doi.org/10.1007/3-540-56279-6_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56279-5
Online ISBN: 978-3-540-47501-9
eBook Packages: Springer Book Archive