In this paper we study proximity structures like Delauney triangulations based on geometric graphs, i.e. graphs which are subgraphs of the complete geometric graph. Given an arbitrary geometric graph G, we define several restricted Voronoi diagrams, restricted Delaunay triangulations, relative neighborhood graphs, Gabriel graphs and then study their complexities when G is a general geometric graph or G is some special graph derived from the application area of wireless networks. Besides being of fundamental interest these structures have applications in topology control for wireless networks. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Kapoor, S., & Li, X. Y. (2003). Proximity structures for geometric graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2748, 365–376. https://doi.org/10.1007/978-3-540-45078-8_32
Mendeley helps you to discover research relevant for your work.