Skip to main content

New Ideas for FN/RFN Queries Based Nearest Voronoi Diagram

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 212))

Abstract

While most research focuses on nearest neighbor (NN) and reverse nearest neighbor (RNN) queries, the furthest neighbor (FN) and reverse furthest neighbor (RFN) query are attracting more and more attention. In this paper, we give new ideas on the FN/RFN query issue. The nearest Voronoi diagram-based (VD-based) algorithms to process FN and RFN queries on 2-dimensional location data on the fly is proposed. These algorithms are especially useful for applications which have VD as their fundamental structure. Instead of constructing a new furthest neighbor diagram (FD), we aim to fully utilize the properties of VD. Besides, we implemented our new methods as well as the most promising competing methods which have been previously proposed. The results consistently indicate that our new algorithms outperform competitors.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.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

Learn about institutional subscriptions

References

  1. Yao B, Li F, Kumar P (2009) Reverse furthest neighbors in spatial databases. In: IEEE international conference on data engineering, pp 664–675

    Google Scholar 

  2. Okabe A, Boots B, Sugihara K (1992) Spatial tesselations concepts and applications of Voronoi diagrams. Wiley, Chichester

    Google Scholar 

  3. Liu J, Chen H, Furuse K, Kitagawa H (2010) An efficient algorithm for reverse furthest neighbors query with metric index. In: Database and expert systems applications. Springer, Berlin

    Google Scholar 

  4. Shamos MI, Hoey D (1975) Closest point problems. In: Proceedings of the sixteenth annual institute of electrical and electronic engineers symposium on the foundations of computer science, IEEE computer society, pp 151–162

    Google Scholar 

  5. www.cs.fsu.edu/lifeifei/SpatialDataset.htm

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wencai Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, W., Yuan, Y. (2013). New Ideas for FN/RFN Queries Based Nearest Voronoi Diagram. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_108

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37502-6_108

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37501-9

  • Online ISBN: 978-3-642-37502-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics