Skip to main content
SpringerLink
Log in

2-Point Site Voronoi Diagrams

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1663))

Included in the following conference series:

Abstract

In this paper we investigate a new type of Voronoi diagrams in which every region is defined by a pair of point sites and some distance function from a point to two points. We analyze the complexity of the respective nearest- and furthest-neighbor diagrams of several such distance functions, and show how to compute the diagrams efficiently.

Work on this paper by the first author has been supported by the U.S. Army Research Office under Grant DAAH04-96-1-0013. Work by the second author has been supported in part by the National Science Foundation under Grant CCR-93-1714.

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. M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi, Crossing-free subgraphs, Annals of Discrete Mathematics, 12 (1982), 9–12.

    MATH  Google Scholar 

  2. H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi, Roundness algorithms using the Voronoi diagrams, Proc. 1st Canadian Conf. on Computational Geometry, 1989, 41.

    Google Scholar 

  3. H. Edelsbrunner, R. Seidel, and M. Sharir, On the zone theorem for hyperplane arrangement, SIAM J. of Computing, 2 (1993), 418–429

    Article  MathSciNet  Google Scholar 

  4. S. Fortune, A sweepline algorithm for Voronoi diagrams, Proc. 2nd Ann. ACM Symp. On Computational Geometry, 1986, 313–322.

    Google Scholar 

  5. L. J. Guibas and R. Seidel, Computing convolutions by reciprocal search, Discrete & Computational Geometry, 2 (1987), 175–193.

    Article  MathSciNet  MATH  Google Scholar 

  6. D. T. Lee, On k-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. on Computing, 31 (1982), 478–487.

    Article  MATH  Google Scholar 

  7. D. T. Lee and R. L. Drysdale, III, Generalization of Voronoi diagrams inthe plane, SIAM J. of Computing, 10 (1981), 73–87.

    Article  MathSciNet  MATH  Google Scholar 

  8. F. T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, MA, 1983.

    Google Scholar 

  9. A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, John Wiley & Sons, Chichester, England, 1992.

    MATH  Google Scholar 

  10. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag, New York, 1985.

    Google Scholar 

  11. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, 1995.

    Google Scholar 

  12. C.-K. Yap, An O(nlog n) algorithm for the Voronoi diagram of a set of simple curve segments, Discrete & Computational Geometry, 2 (1987), 365–393.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Geometric Computing, Dept. of Computer Science, Johns Hopkins University, Baltimore, MD, 21218-2694

    Gill Barequet

  2. Dept. of Mathematics and Computer Science, Middlebury College, Middlebury, VT, 05753

    Matthew T. Dickerson

  3. Dept. of Computer Science, Dartmouth College, 6211 Sudikoff Lab, Hanover, NH, 03755-3510

    Robert L. ScotDrysdale

Authors
  1. Gill Barequet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew T. Dickerson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert L. ScotDrysdale
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. School of Computer Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Arvind Gupta

  3. Center for Geometric Computing Providence, Brown University, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barequet, G., Dickerson, M.T., ScotDrysdale, R.L. (1999). 2-Point Site Voronoi Diagrams. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-48447-7_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66279-2

  • Online ISBN: 978-3-540-48447-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation