Incremental construction of the Delaunay triangulation and the Delaunay graph in medium dimension

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2009, Pages 208-216

  Boissonnat, Jean Daniel ^a   Devillers, Olivier ^a   Hornus, Samuel ^a  

^a INRIA   (France)

Author keywords

Delaunay graph; Delaunay triangulation

Indexed keywords

COMPUTING PARADIGM; CONVEX HULL; DELAUNAY GRAPH; DELAUNAY TRIANGULATION; INCREMENTAL ALGORITHM; INCREMENTAL CONSTRUCTION; INPUT SET; MEMORY USAGE; MODIFIED ALGORITHMS; ORIGINAL ALGORITHMS;

ALGORITHMS; TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 70849125443     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542362.1542403     Document Type: Conference Paper

References (24)

1. E. Aganj, J.-P. Pons, F. Ségonne, and R. Keriven. Spatio-temporal shape from silhouette using four dimensional Delaunay meshing. In IEEE International Conference on Computer Vision, 2007.
2. N. Amenta, S. Choi, and G. Rote. Incremental constructions con BRIO. In Proceedings of the 19th annual symposium on Computational Geometry, pages 211-219, New York, NY, USA, 2003. ACM.
3. D. K. Blandford, G. E. Blelloch, D. E. Cardoze, and C. Kadow. Compact representations of simplicial meshes in two and three dimensions. In Proc. 12th International Meshing Roundtable, pages 135-146, 2003.
4. D. K. Blandford, G. E. Blelloch, and I. A. Kash. Compact representations of separable graphs. In Proceedings of the fourteenth annual ACM-SIAMsymposium on Discrete algorithms, pages 679-688, 2003.
5. C. E. Board. CGAL User and Reference Manual, 3.3 edition, 2007.
6. J.-D. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec. Triangulations in CGAL. Comput. Geom. Theory Appl., 22:5-19, 2002.
7. J.-D. Boissonnat and M. Teillaud. On the randomized construction of the Delaunay tree. Theoret. Comput. Sci., 112:339-354, 1993.
8. H. Brönnimann, C. Burnikel, and S. Pion. Interval arithmetic yields efficient dynamic filters for computational geometry. Discrete Applied Mathematics, 109(1-2):25-47, Apr. 2001. A preliminary version of this paper appeared in the 14th annual ACM symposium on Computational Geometry, Minneapolis, June 1998.
9. A. R. Butz. Alternative algorithm for Hilbert's space-filling curve. IEEE Trans. Comput., 20(4):424-426, 1971.
10. K. Clarkson, K. Mehlhorn, and R. Seidel. Four results on randomized incremental constructions. Computational Geometry: Theory and Applications, 3(4):185-212, Sept. 1993.
11. C. Delage. Spatial sorting. In C. E. Board, editor, CGAL User and Reference Manual. www.cgal.org, 3.3 edition, 2007.
12. E. D. Demaine, A. López-Ortiz, and J. I. Munro. Adaptive set intersections, unions, and differences. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 743-752, 2000.
13. O. Devillers, S. Pion, and M. Teillaud. Walking in a triangulation. Internat. J. Found. Comput. Sci., 13:181-199, 2002.
14. R. A. Dwyer. Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput. Geom., 6:343-367, 1991.
15. M. Hemmer, S. Hert, L. Kettner, S. Pion, and S. Schirra. Number types. In C. E. Board, editor, CGAL User and Reference Manual. CGAL, 3.3 edition, 2007.
16. S. Hornus and J.-D. Boissonnat. Efficient construction of the delaunay triangulation in medium dimension. Research Report 6743, INRIA, 2008.
17. M. Isenburg, Y. Liu, J. Shewchuk, and J. Snoeyink. Streaming computation of delaunay triangulations. ACM Trans. Graph., 25(3):1049-1056, 2006.
18. G. Jin and J. Mellor-Crummey. SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion. ACM Trans. Math. Softw., 31(1):120-148, 2005.
19. M. Kallmann and D. Thalmann. Star-vertices: A compact representation for planar meshes withadjacency information. Journal of Graphics Tools, 6:7-18, 2001.
20. P. Kumar and E. A. Ramos. I/O-efficient construction of Voronoi diagrams. Technical report, Max Planck Institute Informatik, Saarbrücken, 2002.
21. M. Maciejewski, S. Colombi, C. Alard, F. Bouchet, and C. Pichon. Phase-space structures I: Acomparison of 6D density estimators. http://arxiv.org/abs/0810.0504v1, Oct. 2008.
22. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, 1994.
23. W. E. Schaap. DTFE: the Delaunay Tessellation Field Estimator. PhD thesis, University of Groningen, 2007. http://irs.ub.rug.nl/ppn/298831376.
24. J. R. Shewchuk. Triangle: Engineering a 2d quality mesh generator and Delaunay triangulator. In First Workshop on Applied Computational Geometry. Association for Computing Machinery, May 1996.