Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space

6th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2009

Volumn , Issue , 2009, Pages 43-52

  Setter, Ophir ^a   Sharir, Micha ^a   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Envelopes; Minimum width annulus; Randomization; Voronoi diagrams

Indexed keywords

COMPUTATIONAL GEOMETRY ALGORITHMS; DISTANCE FUNCTIONS; DIVIDE AND CONQUER; DIVIDE-AND-CONQUER APPROACH; EXACT RESULTS; PARAMETRIC SURFACES; RUNNING TIME; VORONOI DIAGRAMS; WORST CASE;

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; TWO DIMENSIONAL;

GRAPHIC METHODS;

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

References (45)

1. M. I. Shamos and D. Hoey, "Closest-point problems," in Proc. 16th IEEE Symp. Found. Comput. Sci., 1975, pp. 151-162.
2. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd ed. NYC: Wiley, 2000.
3. F. Aurenhammer and R. Klein, "Voronoi diagrams," in Handb. Comput. Geom., J.-R. Sack and J. B. Urrutia, Eds. Elsevier, 2000, ch. 5, pp. 201-290.
4. J.-D. Boissonnat, C. Wormser, and M. Yvinec, "Curved Voronoi diagrams," in Effective Computational Geometry for Curves and Surfaces, J.-D. Boissonnat and M. Teillaud, Eds. Springer, 2006.
5. G. Barequet, M. T. Dickerson, and R. L. S. Drysdale, "2-point site Voronoi diagrams," Disc. Appl. Math., vol. 122, no. 1-3, pp. 37-54, 2002.
6. R. Klein, Concrete and Abstract Voronoi Diagrams, ser. LNCS. Springer, 1989, vol. 400.
7. R. Klein, K. Mehlhorn, and S. Meiser, "Randomized incremental construction of abstract Voronoi diagrams," Comput. Geom. Theory Appl., vol. 3, no. 3, pp. 157-184, August 1993.
8. S. J. Fortune, "A sweepline algorithm for Voronoi diagrams," Algorithmica, vol. 2, no. 1-4, pp. 153-174, November 1987.
9. L. J. Guibas, D. E. Knuth, and M. Sharir, "Randomized incremental construction of Delaunay and Voronoi diagrams," Algorithmica, vol. 7, no. 1-6, pp. 381-413, June 1992.
10. M. I. Karavelas and M. Yvinec, "The Voronoi diagram of planar convex objects," in Proc. 11th Annu. Eur. Symp. Alg., 2003, pp. 337-348.
11. O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer, and M. Rabl, "Divide-and-conquer for Voronoi diagrams revisited," in Abstracts of 25th Eur. Workshop Comput. Geom., 2009, pp. 293-296.
12. J.-D. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec, "Triangulations in CGAL," Comput. Geom. Theory Appl., vol. 22, no. 1-3, pp. 5-19, May 2002.
13. I. Z. Emiris and M. I. Karavelas, "The predicates of the Apollonius diagram: Algorithmic analysis and implementation," Comput. Geom. Theory Appl., vol. 33, no. 1-2, pp. 18-57, January 2006.
14. M. I. Karavelas, "A robust and efficient implementation for the segment Voronoi diagram," in Proc. 1st Int. Symp. on Voronoi Diagrams in Sci. and Engineering, 2004, pp. 51-62.
15. I. Z. Emiris, E. P. Tsigaridas, and G. Tzoumas, "Voronoi diagram of ellipses in CGAL," in Abstracts of 24th Eur. Workshop Comput. Geom., 2008, pp. 87-90.
16. C. Burnikel, K. Mehlhorn, and S. Schirra, "How to compute the Voronoi diagram of line segments: Theoretical and experimental results," in Proc. 2nd Annu. Eur. Symp. Alg., ser. LNCS, vol. 855. Springer, 1994, pp. 227-239.
17. M. Seel, "Eine Implementierung abstrakter Voronoidiagramme," Master's thesis, Universität des Saarlandes, 1994.
18. M. Held, "VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments," Comput. Geom. Theory Appl., vol. 18, no. 2, pp. 95-123, March 2001.
19. K. E. Hoff III, J. Keyser, M. Lin, D. Manocha, and T. Culver, "Fast computation of generalized Voronoi diagrams using graphics hardware," in Proc. 26th Annu. Int. Conf. on Comput. Graphics and Interactive Techniques. ACM Press, 1999, pp. 277-286.
20. 6: Advanced Rendering Techniques. Charles River Media, 2008.
21. H. Edelsbrunner and R. Seidel, "Voronoi diagrams and arrangements," Disc. Comput. Geom., vol. 1, no. 1, pp. 25-44, December 1986.
22. K. Sugihara, "Laguerre Voronoi diagram on the sphere," J. for Geom. Graphics, vol. 6, no. 1, pp. 69-81, 2002.
23. M. Meyerovitch, "Robust, generic and efficient construction of envelopes of surfaces in three-dimensional space," in Proc. 14th Annu. Eur. Symp. Alg., 2006, pp. 792-803.
24. M. Meyerovitch, R. Wein, and B. Zukerman, "3D envelopes," in CGAL User and Reference Manual, 3rd ed., C. E. Board, Ed., 2008.
25. P. K. Agarwal, O. Schwarzkopf, and M. Sharir, "The overlay of lower envelopes and its applications," Disc. Comput. Geom., vol. 15, no. 1, pp. 1-13, January 1996. (Pubitemid 126317926)
26. O. Setter, "Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space," M.Sc. Thesis, The Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel, Forthcoming, draft version can be found at: http://acg.cs.tau.ac.il/projects/internal- projects/ vd-via-dc-of-envelopes/thesis.pdf.
27. E. Berberich, E. Fogel, D. Halperin, K. Mehlhorn, and R. Wein, "Sweeping and maintaining two-dimensional arrangements on surfaces: A first step," in Proc. 15th Annu. Eur. Symp. Alg., ser. LNCS, vol. 4698. Springer, 2007, pp. 645-656.
28. H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi, "Roundness algorithms using the Voronoi diagrams," in Abstracts of 1st Canadian Conf. on Comput. Geom., 1989, p. 41.
29. A. Eigenwillig and M. Kerber, "Exact and efficient 2Darrangements of arbitrary algebraic curves," in Proc. 19th Annu. ACM-SIAM Symp. Disc. Alg. Philadelphia, PA, USA: Soc. for Industrial and Applied Math. (SIAM), 2008, pp. 122- 131.
30. E. Berberich and P. Emeliyanenko, "CGAL's curved kernel via analysis," MPI, ACS Technical Report ACS-TR-123203-04, 2008.
31. F. Aurenhammer and H. Edelsbrunner, "An optimal algorithm for constructing the weighted Voronoi diagram in the plane," Pattern Recognition, vol. 17, no. 2, pp. 251-257, 1984.
32. CGAL User and Reference Manual, 3rd ed., 2008.
33. C.-K. Yap and T. Dube, "The exact computation paradigm," in Computing in Euclidean Geometry, 2nd ed., ser. LNCS, D.- Z. Du and F. K. Hwang, Eds. Singapore: World Scientific, 1995, vol. 1, pp. 452-492.
34. M. H. Austern, Generic Programming and the STL. Addison-Wesley, 1999.
35. R. Wein, E. Fogel, B. Zukerman, and D. Halperin, "2D arrangements," in CGAL User and Reference Manual, 3rd ed., C. E. Board, Ed., 2008.
36. M. Sharir, "The Clarkson-Shor technique revisited and extended," Combinatorics, Probability & Computing, vol. 12, no. 2, 2003.
37. L. J. Guibas and R. Seidel, "Computing convolutions by reciprocal search," Disc. Comput. Geom., vol. 2, no. 1, pp. 175-193, December 1987.
38. E. Fogel, O. Setter, and D. Halperin, "Exact implementation of arrangements of geodesic arcs on the sphere with applications," in Abstracts of 24th Eur. Workshop Comput. Geom., 2008, pp. 83-86.
39. "Movie: Arrangements of geodesic arcs on the sphere," in Proc. 24th Annu. ACM Symp. Comput. Geom. New York, NY, USA: ACM Press, 2008, pp. 218-219.
40. D. E. Knuth, Art of Computer Programming, Volume 3: Sorting and Searching, 2nd ed. Addison-Wesley, April 1998.
41. T. J. Rivlin, "Approximating by circles," Computing, vol. 21, pp. 93-104, 1979.
42. P. Bose and L. Devroye, "Intersections with random geometric objects," Comput. Geom. Theory Appl., vol. 10, no. 3, pp. 139-154, June 1998.
43. F. Nielsen, J.-D. Boissonnat, and R. Nock, "On Bregman Voronoi diagrams," in Proc. 18th Annu. ACM-SIAM Symp. Disc. Alg. Philadelphia, PA, USA: Soc. for Industrial and Applied Math. (SIAM), 2007, pp. 746-755.
44. K. Onishi and N. Takayama, "Construction of Voronoi diagram on the upper half-plane," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. 79, no. 4, pp. 533-539, 1996.
45. Z. Nilforoushan and A. Mohades, "Hyperbolic Voronoi diagram," in Proc. 2006 International Conference on Computational Science and Its Applications, 2006, pp. 735-742.