Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)
Fortune, S.: Voronoi diagrams and delaunay triangulations. In: Hwang, F.K., Du, D.-Z. (eds.) Computing in Euclidean Geometry, pp. 193–233. World Scientific, Singapore (1992)
Preparata, F.P., Shamos, M.I.: Computational Geometry: an Introduction. Springer, Heidelberg (1985)
Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18, 259–278 (1969)
Bose, P., Devroye, L., Evans, W., Kirkpatrick, D.: On the spanning ratio of Gabriel graphs and beta-skeletons. In: Proceedings of the Latin American Theoretical Infocomatics, LATIN (2002)
Jaromczyk, J.W., Kowaluk, M.: Constructing the relative neighborhood graph in three-dimensional euclidean space. Discrete Applied Mathematics, 181–192 (1991)
Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. Proceedings of IEEE 80, 1502–1517 (1992)
Supowit, K.J.: The relative neighborhood graph, with an application to minimum spanning trees. Journal of Associate Computing Machine (1983)
Li, X.Y., Calinescu, G., Wan, P.J.: Distributed construction of planar spanner and routing for ad hoc wireless networks. In: 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 3 (2002)
Bollobás, B.: Extremal Graph Theory. Academic Press, London (1978)
Faloutsos, M., Molle, M.: Creating optimal distributed algorithms for minimum spanning trees. Technical Report CSRI-327 (also in WDAG 1995) (1995)
Alzoubi, K., Wan, P.J., Frieder, O.: Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks. In: 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2002) (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapoor, S., Li, XY. (2003). Proximity Structures for Geometric Graphs. In: Dehne, F., Sack, JR., Smid, M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45078-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-45078-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40545-0
Online ISBN: 978-3-540-45078-8
eBook Packages: Springer Book Archive