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 hounded 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 (R2, Lp) metric space.
CITATION STYLE
Jennings, E., & Lingas, A. (1992). On the relationships among constrained geometric structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 650 LNCS, pp. 289–298). Springer Verlag. https://doi.org/10.1007/3-540-56279-6_82
Mendeley helps you to discover research relevant for your work.