Fast localized delaunay triangulation

Lecture Notes in Computer Science

Volumn 3544, Issue , 2005, Pages 81-93

  Araújo, Filipe ^a   Rodrigues, Luís ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Delaunay triangulation; Location based routing schemes; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; COSTS; GRAPH THEORY; INFORMATION ANALYSIS; ROUTERS;

DELAUNAY TRIANGULATION; LOCATION-BASED ROUTING SCHEMES; RELATIVE NEIGHBORHOOD GRAPHS; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 26444512054     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11516798_6     Document Type: Conference Paper

References (20)

1. Jean-Daniel Boissonnat and Monique Teillaud. On the randomized construction of the Delaunay tree. Theoretical Computer Science, 112(2):339-354, 1993.
2. Prosenjit Bose and Pat Morin. Online routing in triangulations. In 10th Annual Internation Symposium on Algorithms and Computation (ISAAC), 1999.
3. Prosenjit Bose, Pat Morin, Ivan Stojmenović, and Jorge Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pages 48-55, 1999.
4. S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, (2):153-174, 1987.
5. K. Gabriel and R. Sokal. A new statistichal approach to geographic variation analysis. Systematic Zoology, 18:259-278, 1969.
6. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, and An Zhu. Geometric spanners for routing in mobile networks. In 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 01), 2001.
7. Brad Karp and H. T. Kung. GPRS: Greedy perimeter stateless routing for wireless networks. In ACM/IEEE International Conference on Mobile Computing and Networking, 2000.
8. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In 11th Canadian Conference on Computation Geometry (CCCG 99), 1999.
9. Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'02), 2002.
10. Luan Lan and Hsu Wen-Jing. Localized Delaunay triangulation for topological construction and routing on manets. In 2nd ACM Workshop on Principles of Mobile Computing (POMC'02), 2002.
11. Der-Tsai Lee and Bruce J. Schachter. Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Sciences, 9(3):219-242, 1980.
12. Xiang-Yang Li, Gruia Calinescu, and Peng-Jun Wan. Distributed construction of a planar spanner and routing for ad hoc wireless networks. In The 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2002.
13. Xiang-Yang Li, Ivan Stojmenovic, and Yu Wang. Partial delaunay triangulation and degree limited localized bluetooth scatternet formation. IEEE Transactions on Parallel and Distributed Systems, 15(4):350-361, April 2004.
14. J. Liebeherr, M. Nahas, and W. Si. Application-layer multicasting with Delaunay triangulation overlays. Technical Report CS-2001-26, University of Virginia, Department of Computer Science, Charlottesville, VA 22904, 5 2001.
15. N. Lynch. Distributed algorithms. In Data Link Protocols, chapter 16, pages 691-732. Morgan-Kaufmann, 1996.
16. F. P. Preparata and M. I. Shamos. Computational geometry: An introduction. Springer-Verlag, New York, 1985.
17. R. Sibson. Locally equiangular triangulations. The Computer Journal, 21(3):243-245, 1977.
18. Ivan Stojmenovic. Position-based routing in ad hoc networks. IEEE Communications Magazine, July 2002.
19. G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 4(12):261-268, 1980.
20. Yu Wang and Xiang-Yang Li. Geometric spanners for wireless ad hoc networks. In The 22nd IEEE International Conference on Distributed Computing Systems, 2002.