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
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.
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi, Crossing-free subgraphs, Annals of Discrete Mathematics, 12 (1982), 9–12.
H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi, Roundness algorithms using the Voronoi diagrams, Proc. 1st Canadian Conf. on Computational Geometry, 1989, 41.
H. Edelsbrunner, R. Seidel, and M. Sharir, On the zone theorem for hyperplane arrangement, SIAM J. of Computing, 2 (1993), 418–429
S. Fortune, A sweepline algorithm for Voronoi diagrams, Proc. 2nd Ann. ACM Symp. On Computational Geometry, 1986, 313–322.
L. J. Guibas and R. Seidel, Computing convolutions by reciprocal search, Discrete & Computational Geometry, 2 (1987), 175–193.
D. T. Lee, On k-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. on Computing, 31 (1982), 478–487.
D. T. Lee and R. L. Drysdale, III, Generalization of Voronoi diagrams inthe plane, SIAM J. of Computing, 10 (1981), 73–87.
F. T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, MA, 1983.
A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, John Wiley & Sons, Chichester, England, 1992.
F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag, New York, 1985.
M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, 1995.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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