Skip to main content
SpringerLink
Log in

Fast Localized Delaunay Triangulation

  • Conference paper
  • First Online:
Principles of Distributed Systems (OPODIS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3544))

Included in the following conference series:

Abstract

A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost imposed by control information is limited and it supports geographical routing algorithms that offer guaranteed convergence. This paper presents a localized algorithm that builds a graph called planar localized Delaunay triangulation, PLDel, known to be a good spanner of the unit disk graph, UDG. Unlike previous work, our algorithm builds PLDel in a single communication step, maintaining a communication cost of O(n log n), which is within a constant of the optimum. This represents a significant practical improvement over previous algorithms with similar theoretical bounds. Furthermore, the small cost of our algorithm makes feasible to use PLDel in real systems, instead of the Gabriel or the Relative Neighborhood graphs, which are not good spanners of UDG.

This work was partially supported by LaSIGE and by the FCT project INDIQoS POSI/CHS/41473/2001 via POSI and FEDER funds.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boissonnat, J.-D., Teillaud, M.: On the randomized construction of the Delaunay tree. Theoretical Computer Science 112(2), 339–354 (1993)

    Article  MathSciNet  Google Scholar 

  2. Bose, P., Morin, P.: Online routing in triangulations. In: 10th Annual Internation Symposium on Algorithms and Computation, ISAAC 1999 (1999)

    Google Scholar 

  3. Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pp. 48–55 (1999)

    Google Scholar 

  4. Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica (2), 153–174 (1987)

    Google Scholar 

  5. Gabriel, K., Sokal, R.: A new statistichal approach to geographic variation analysis. Systematic Zoology 18, 259–278 (1969)

    Article  Google Scholar 

  6. Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanners for routing in mobile networks. In: 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2001 (2001)

    Google Scholar 

  7. Karp, B., Kung, H.T.: GPRS: Greedy perimeter stateless routing for wireless networks. In: ACM/IEEE International Conference on Mobile Computing and Networking (2000)

    Google Scholar 

  8. Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: 11th Canadian Conference on Computation Geometry, CCCG 1999 (1999)

    Google Scholar 

  9. Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIALM 2002 (2002)

    Google Scholar 

  10. Lan, L., Wen-Jing, H.: Localized Delaunay triangulation for topological construction and routing on manets. In: 2nd ACM Workshop on Principles of Mobile Computing, POMC 2002 (2002)

    Google Scholar 

  11. Lee, D.-T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Sciences 9(3), 219–242 (1980)

    Article  MathSciNet  Google Scholar 

  12. Li, X.-Y., Calinescu, G., Wan, P.-J.: 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)

    Google Scholar 

  13. Li, X.-Y., Stojmenovic, I., Wang, Y.: Partial delaunay triangulation and degree limited localized bluetooth scatternet formation. IEEE Transactions on Parallel and Distributed Systems 15(4), 350–361 (2004)

    Article  Google Scholar 

  14. Liebeherr, J., Nahas, M., Si, W.: Application-layer multicasting with Delaunay triangulation overlays. Technical Report CS-2001-26, University of Virginia, Department of Computer Science, Charlottesville, VA 22904, 5 (2001)

    Google Scholar 

  15. Lynch, N.: Distributed algorithms. In: Data Link Protocols, ch. 16, pp. 691–732. Morgan-Kaufmann, San Francisco (1996)

    Google Scholar 

  16. Preparata, F.P., Shamos, M.I.: Computational geometry: An introduction. Springer, Heidelberg (1985)

    Book  Google Scholar 

  17. Sibson, R.: Locally equiangular triangulations. The Computer Journal 21(3), 243–245 (1977)

    Article  MathSciNet  Google Scholar 

  18. Stojmenovic, I.: Position-based routing in ad hoc networks. IEEE Communications Magazine (July 2002)

    Google Scholar 

  19. Toussaint, G.: The relative neighborhood graph of a finite planar set. Pattern Recognition 4(12), 261–268 (1980)

    Article  Google Scholar 

  20. Wang, Y., Li, X.-Y.: Geometric spanners for wireless ad hoc networks. In: The 22nd IEEE International Conference on Distributed Computing Systems (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Faculdade de Ciências, Universidade de Lisboa, Campo Grande, Edifício C6, 1749-016, Lisboa, Portugal

    Filipe Araújo & Luís Rodrigues

Authors
  1. Filipe Araújo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Rodrigues
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Science Technology and Agency, CREST, Japan

    Teruo Higashino

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Araújo, F., Rodrigues, L. (2005). Fast Localized Delaunay Triangulation. In: Higashino, T. (eds) Principles of Distributed Systems. OPODIS 2004. Lecture Notes in Computer Science, vol 3544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11516798_6

Download citation

  • DOI: https://doi.org/10.1007/11516798_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27324-0

  • Online ISBN: 978-3-540-31584-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation