Computing the 3D Voronoi diagram robustly: An easy explanation

Proceedings - ISVD 2007 The 4th International Symposium on Voronoi Diagrams in Science and Engineering 2007

Volumn , Issue , 2007, Pages 117-129

  Ledoux, Hugo ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SIZE DISTRIBUTION;

3D VORONOI DIAGRAMS; DELAUNAY TETRAHEDRALIZATION; GEOMETRIC COMPUTING; SPATIAL DISTRIBUTION OF;

THREE DIMENSIONAL;

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

References (40)

1. N. Amenta, S. Choi, and G. Rote. Incremental constructions con BRIO. In Proceedings 19th Annual Symposium on Computational Geometry, pages 211-219, San Diego, USA, 2003. ACM Press.
2. F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345-405, 1991.
3. C. B. Barber, D. P. Dobkin, and H. T. Huhdanpaa. The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software, 22(4):469-483, 1996.
4. J.-D. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec. Triangulations in CGAL. Computational Geometry - Theory and Applications, 22:5-19, 2002.
5. B. Boots. Delaunay triangles, an alternative approach to point pattern analysis. In Proceedings, Association of American Geographers, 6, pages 26-29, 1974.
6. A. Bowyer. Computing Dirichlet tessellations. Computer Journal, 24(2):162-166, 1981.
7. d. Computer-Aided Design, 30(5):333-341, 1998.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational geometry: Algorithms and applications. Springer-Verlag, Berlin, second edition, 2000.
9. O. Devillers. The Delaunay hierarchy. International Journal of Foundations of Computer Science, 13(2):163-180, 2002.
10. O. Devillers, S. Pion, and M. Teillaud. Walking in a triangulation. International Journal of Foundations of Computer Science, 13(2):181-199, 2002.
11. D. P. Dobkin and M. J. Laszlo. Primitives for the manipulation of three-dimensional subdivisions. Algorithmica, 4:3-32, 1989.
12. D. Douglas. It makes me so CROSS. Unpublished manuscript from the Harvard Laboratory for Computer Graphics and Spatial Analysis. Reprinted in Peuquet DJ, Marble, DF, editors, Introductory Readings in Geographic Information System, pages 303-307. Taylor & Francis, London, 1974.
13. H. Edelsbrunner and N. R. Shah. Incremental topological flipping works for regular triangulations. Algorithmica, 15:223-241, 1996.
14. D. A. Field. Implementing Watson's algorithm in three dimensions. In Proceedings 2nd Annual Symposium on Computational Geometry, volume 246-259, Yorktown Heights, New York, USA, 1986. ACM Press.
15. S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987.
16. C. M. Gold, T. D. Charters, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each triangular domain. In Proceedings Siggraph '77, volume 11(2), pages 170-175, 1977.
17. L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics, 4:74-123, 1985.
18. C. M. Hoffmann. The problems of accuracy and robustness in geometric computation. Computer - IEEE Computer Society Press, 22:31-42, 1989.
19. M. Isenburg, Y. Liu, J. R. Shewchuk, and J. Snoeyink. Streaming computation of Delaunay triangulations. ACM Transactions on Graphics, 25(3):1049-1056, 2006.
20. B. Joe. Three-dimensional triangulations from local transformations. SIAM Journal on Scientific and Statistical Computing, 10(4):718-741, 1989.
21. B. Joe. Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design, 8:123-142, 1991.
22. V. Karamcheti, C. Li, I. Pechtchanski, and C. K. Yap. A CORE library for robust numeric and geometric computation. In Proceedings 15th Annual Symposium on Computational Geometry, volume 351-359, Miami, Florida, USA, 1999. ACM Press.
23. M. Karasick, D. Lieber, and L. R. Nackman. Efficient Delaunay triangulation using rational arithmetic. ACM Transactions on Graphics, 10(1):71-91, 1991.
24. 1 surface interpolation. In J. R. Rice, editor, Mathematical software III, pages 161-194. Academic Press, 1977.
25. C. L. Lawson. Properties of n-dimensional triangulations. Computer Aided Geometric Design, 3:231-246, 1986.
26. H. Ledoux. Modelling three-dimensional fields in geoscience with the Voronoi diagram and its dual. PhD thesis, School of Computing, University of Glamorgan, Pontypridd, Wales, UK, 2006.
27. H. Ledoux and C. M. Gold. Simultaneous storage of primal and dual three-dimensional subdivisions. Computers, Environment and Urban Systems, 2006. In press.
28. Y. Liu and J. Snoeyink. A comparison of five implementations of 3D Delaunay tessellation. In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, volume 52, pages 439-458. Cambridge University Press, 2005.
29. Y. Liu and J. Snoeyink. TESS3: A program to compute 3D Delaunay tessellations for well-distributed points. In Proceedings 2nd International Symposium on Voronoi Diagrams in Science and Engineering, pages 225-234, Seoul, Korea, 2005.
30. E. P. Mücke. A robust implementation for three-dimensional Delaunay triangulations. International Journal of Computational Geometry and Applications, 8(2):255-276, 1998.
31. E. P. Mücke, I. Saias, and B. Zhu. Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. Computational Geometry - Theory and Applications, 12:63-83, 1999.
32. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial tessellations: Concepts and applications of Voronoi diagrams. John Wiley and Sons, second edition, 2000.
33. A. Saalfeld. It doesn't make me nearly as CROSS: Some advantages of the point-vector representation of line segments in automated cartography. International Journal of Geographical Information Systems, 1(4):379-386, 1987.
34. J. R. Shewchuk. Adaptive precision floating point arithmetic and fast robust geometric predicates. Discrete & Computational Geometry, 18:305-363, 1997.
35. J. R. Shewchuk. Delaunay Refinement Mesh Generation. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburg, USA, 1997.
36. J. R. Shewchuk. Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations. In Proceedings 16th Annual Symposium on Computational Geometry, pages 350-359, Hong Kong, 2000. ACM Press.
37. J. R. Shewchuk. Updating and constructing constrained Delaunay and constrained regular triangulations by flips. In Proceedings 19th Annual Symposium on Computational Geometry, pages 181-190, San Diego, USA, 2003. ACM Press.
38. K. Sugihara and I. Hiroshi. Why is the 3D Delaunay triangulation difficult to construct? Information Processing Letters, 54:275-280, 1995.
39. D. F. Watson. Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. Computer Journal, 24(2):167-172, 1981.
40. C. K. Yap and T. Dubé. The exact computation paradigm. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, pages 452-486. World Scientific Press, second edition, 1995.