On 2-site Voronoi diagrams under geometric distance functions

Proceedings - 2011 8th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2011

Volumn , Issue , 2011, Pages 31-38

  Barequet, Gill ^a   Dickerson, Matthew T ^b   Eppstein, David ^c   Hodorkovsky, David ^a   Vyatkina, Kira ^d,e  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MIDDLEBURY COLLEGE   (United States)

^c 5226 Donald Bren Hall   (United States)

^d ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

^e ITMO UNIVERSITY   (Russian Federation)

Author keywords

crossing number lemma; Davenport Schinzel theory; distance function; lower envelope

Indexed keywords

CROSSING-NUMBER LEMMA; DAVENPORT-SCHINZEL THEORY; DISTANCE FUNCTION; DISTANCE FUNCTIONS; GEOMETRIC DISTANCES; GEOMETRIC PRIMITIVES; LOWER ENVELOPES; POINT SET; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

GRAPHIC METHODS;

EID: 80052619017     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISVD.2011.13     Document Type: Conference Paper

References (17)

1. M. AJTAI, V. CHVÁTAL, M. NEWBORN, AND E. SZEMERÉDI, Crossing-free subgraphs, Annals of Discrete Mathematics, 12 (1982), 9-12.
2. T. ASANO, N. KATOH, H. TAMAKI, AND T. TOKUYAMA, Angular Voronoi diagram with applications, Proc. 3rd Int. Symp. on Voronoi Diagrams in Science and Engineering, Banff, Canada, 32-39, 2006.
3. T. ASANO, N. KATOH, H. TAMAKI, AND T. TOKUYAMA, Voronoi diagrams with respect to criteria on vision information, Proc. 4th Int. Symp. on Voronoi Diagrams in Science and Engineering, Pontypridd, Wales, UK, 25-32, 2007.
4. F. AURENHAMMER, Voronoi diagram - A survey of a fundamental geometric data structure, ACM Computing Surveys, 23 (1991), 345-405.
5. G. BAREQUET, M.T. DICKERSON, AND R.L.S. DRYSDALE, 2-point site Voronoi diagrams, Discrete Applied Mathematics, 122 (2002), 37-54.
6. M. DE BERG, M. VAN KREVELD, M. OVERMARS, AND O. SCHWARZKOPF, Computational Geometry, Algorithms, and Applications (3rd ed.), Springer-Verlag, Berlin, 2008.
7. M.T. DICKERSON AND D. EPPSTEIN, Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions), Proc. 25th ACM Symp. on Computational Geometry, Aarhus, Denmark, 92-93, 2009.
8. M. GAVRILOVA (ED.), Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence. Springer, 2008.
9. I. HANNIEL AND G. BAREQUET, On the triangle-perimeter two-site Voronoi diagram, Proc. 6th Int. Symp. on Voronoi Diagrams, Copenhagen, Denmark, 129-136, 2009.
10. D. HODORKOVSKY, 2-Point Site Voronoi Diagrams, M.Sc. Thesis, The Technion - Israel Inst. of Technology, Haifa, Israel, 2005.
11. D.T. LEE, On k-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. on Computers, 31 (1982), 478-487.
12. F.T. LEIGHTON, Complexity Issues in VLSI, MIT Press, Cambridge, MA, 1983.
13. A. OKABE, A. BOOTS, B. SUGIHARA, AND S.N. CHUI, Spatial Tesselations, 2nd ed., Wiley, 2000.
14. K.F. ROTH, On a problem of Heilbronn, Proc. London Mathematical Society, 26 (1951), 198-204.
15. M.I. SHAMOS AND D. HOEY, Closest-point problems, Proc. 16th Ann. IEEE Symp. on Foundations of Computer Science, Berkeley, CA, 151-162, 1975.
16. M. SHARIR AND P.K. AGARWAL, Davenport-Schinzel Sequences and Their Geometric Application, Cambridge University Press, 1995.
17. K. VYATKINA AND G. BAREQUET, On 2-site Voronoi diagrams under arithmetic combinations of point-to-point distances, Proc. 7th Int. Symp. on Voronoi Diagrams, Québec City, Québec, Canada, 33-41, 2010.