2-point site voronoi diagrams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1663, Issue , 1999, Pages 219-230

  Barequet, Gill ^a,b   Dickerson, Matthew T ^c   Scotdrysdale, Robert L ^d  

^a Johns Hopkins University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c MIDDLEBURY COLLEGE   (United States)

^d Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES;

DISTANCE FUNCTIONS; TWO-POINT; VORONOI DIAGRAMS;

GRAPHIC METHODS;

EID: 84948959414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_23     Document Type: Conference Paper

References (12)

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