Advertisement

2-Point Site Voronoi Diagrams

  • Gill Barequet
  • Matthew T. Dickerson
  • Robert L. ScotDrysdale
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1663)

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.

Keywords

Distance Function Voronoi Diagram Combinatorial Complexity Point Site Unordered Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ACNS]
    M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi, Crossing-free subgraphs, Annals of Discrete Mathematics, 12 (1982), 9–12.zbMATHGoogle Scholar
  2. [EFNN]
    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. [ESS]
    H. Edelsbrunner, R. Seidel, and M. Sharir, On the zone theorem for hyperplane arrangement, SIAM J. of Computing, 2 (1993), 418–429MathSciNetCrossRefGoogle Scholar
  4. [Fo]
    S. Fortune, A sweepline algorithm for Voronoi diagrams, Proc. 2nd Ann. ACM Symp. On Computational Geometry, 1986, 313–322.Google Scholar
  5. [GS]
    L. J. Guibas and R. Seidel, Computing convolutions by reciprocal search, Discrete & Computational Geometry, 2 (1987), 175–193.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [Le]
    D. T. Lee, On k-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. on Computing, 31 (1982), 478–487.zbMATHCrossRefGoogle Scholar
  7. [LD]
    D. T. Lee and R. L. Drysdale, III, Generalization of Voronoi diagrams inthe plane, SIAM J. of Computing, 10 (1981), 73–87.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [Le1]
    F. T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, MA, 1983.Google Scholar
  9. [OBS]
    A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, John Wiley & Sons, Chichester, England, 1992.zbMATHGoogle Scholar
  10. [PS]
    F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag, New York, 1985.Google Scholar
  11. [SA]
    M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, 1995.Google Scholar
  12. [Ya]
    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.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gill Barequet
    • 1
  • Matthew T. Dickerson
    • 2
  • Robert L. ScotDrysdale
    • 3
  1. 1.Center for Geometric Computing, Dept. of Computer ScienceJohns Hopkins UniversityBaltimore
  2. 2.Dept. of Mathematics and Computer ScienceMiddlebury CollegeMiddlebury
  3. 3.Dept. of Computer ScienceDartmouth CollegeHanover

Personalised recommendations