Skip to main content

Voronoi Diagrams

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Akdogan A, Demiryurek U, Banaei-Kashani F, Shahabi C. Voronoi-based geospatial query processing with MapReduce. CloudCom. Indianapolis/IN/USA: IEEE; 2010, p. 9–16. http://ieeexplore.ieee.org/document/5708428/.

  2. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O. Computational geometry: algorithms and applications. 2nd ed. Berlin/Heidelberg/New York: Springer; 2000.

    Book  MATH  Google Scholar 

  3. Hagedoorn M. Nearest neighbors can be found efficiently if the dimension is small relative to the input size. In: Proceedings of the 9th the International Conference on Database Theory; 2003. p. 440–54.

    Google Scholar 

  4. Kolahdouzan M, Shahabi C. Voronoi-based K nearest neighbor search for spatial network databases. In: Proceedings of the 30th the International Conference on Very Large Data Bases; 2004. p. 840–51.

    Chapter  Google Scholar 

  5. Korn F, Muthukrishnan S. Influence sets based on reverse nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 201–12.

    Article  Google Scholar 

  6. Maneewongvatana S. Multi-dimensional nearest neighbor searching with low-dimensional data. PhD thesis, Computer Science Department, University of Maryland, College Park. 2001.

    Google Scholar 

  7. Okabe A, Boots B, Sugihara K, Chiu SN. Spatial tessellations, concepts and applications of Voronoi diagrams. 2nd ed. Chichester: Wiley; 2000.

    Book  MATH  Google Scholar 

  8. Sharifzadeh M. Spatial query processing using Voronoi diagrams. PhD thesis, Computer Science Department, University of Southern California, Los Angeles. 2007.

    Google Scholar 

  9. Sharifzadeh M, Shahabi C. VoR-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries. Proc. VLDB Endowment. 2010;3(1):1231–42.

    Article  Google Scholar 

  10. Stanoi I, Riedewald M, Agrawal D, El Abbadi A. Discovery of influence sets in frequently updated databases. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001. p. 99–108.

    Google Scholar 

  11. Xu J, Zheng B, Lee W-C, Lee DL. The D-tree: an index structure for planar point queries in location-based wireless services. IEEE Trans Knowl Data Eng. 2004;16(12):1526–42.

    Article  Google Scholar 

  12. Zhang J, Zhu M, Papadias D, Tao Y, Lee DL. Location-based spatial queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2003. p. 443–53.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cyrus Shahabi .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Shahabi, C., Sharifzadeh, M. (2018). Voronoi Diagrams. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_451

Download citation

Publish with us

Policies and ethics