Computing 2D constrained Delaunay triangulation using the GPU

Proceedings - I3D 2012: ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games

Volumn , Issue , 2012, Pages 39-46

  Qi, Meng ^a   Cao, Thanh Tung ^a   Tan, Tiow Seng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

computational geometry; GPGPU; Voronoi diagram

Indexed keywords

CONSTRAINED DELAUNAY TRIANGULATION; CONSTRAINED DELAUNAY TRIANGULATIONS; DELAUNAY TRIANGULATION; GIS DATA; GPGPU; HYBRID APPROACH; NUMERICALLY ROBUST; PROGRAMMING MODELS; SEQUENTIAL IMPLEMENTATION; STRAIGHT-LINE GRAPHS; VORONOI DIAGRAMS;

COMPUTATIONAL EFFICIENCY; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS EQUIPMENT; COMPUTER PROGRAMMING; GRAPH THEORY; INTERACTIVE COMPUTER GRAPHICS; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS; THREE DIMENSIONAL;

PROBLEM SOLVING;

EID: 84859837113     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2159616.2159623     Document Type: Conference Paper

References (21)

1. AURENHAMMER, F. 1991. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys 23, 3, 345-405.
2. BOISSONNAT, J.-D. 1988. Shape reconstruction from planar cross sections. Computer Vision, Graphics, and Image Processing 44, 1, 1-29.
3. CAO, T.-T., EDELSBRUNNER, H., AND TAN, T.-S. 2010. Proof of correctness of the digital Delaunay triangulation algorithm. http://www.comp.nus.edu.sg/ ~tants/delaunay2DDownload files/notes-30-april-2011.pdf.
4. CAO, T.-T., TANG, K., MOHAMED, A., AND TAN, T.-S. 2010. Parallel banding algorithm to compute exact distance transform with the GPU. In I3D '10: Proc. ACM Symp. Interactive 3D Graphics and Games, ACM, New York, NY, USA, 83-90.
5. CGAL, 2011. CGAL, Computational Geometry Algorithms Library. http://www.cgal.org.
6. CHEW, L. P. 1989. Constrained Delaunay triangulations. Algorithmica 4, 97-108.
7. DWYER, R. 1987. A faster divide-and-conquer algorithm for constructing delaunay triangulations. Algorithmica 2, 137-151.
8. FISCHER, I., AND GOTSMAN, C. 2006. Fast approximation of high-order voronoi diagrams and distance transforms on the GPU. J. Graphics Tools 11, 4, 39-60.
9. FORTUNE, S. 1987. A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153-174.
10. FORTUNE, S. 1997. Handbook of discrete and computational geometry. CRC Press, Inc., Boca Raton, FL, USA, ch. Voronoi diagrams and Delaunay triangulations, 377-388.
11. GUIBAS, L., KNUTH, D., AND SHARIR, M. 1992. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7, 381-413.
12. HIGHNAM, P. T. 1982. The ears of a polygon. In Information Processing Letters, 196-198.
13. HOFF, III, K. E., KEYSER, J., LIN, M., MANOCHA, D., AND CULVER, T. 1999. Fast computation of generalized Voronoi diagrams using graphics hardware. In Proc. ACM SIGGRAPH '99, ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 277-286.
14. KALLMANN, M., BIERI, H., AND THALMANN, D. 2003. Fully dynamic constrained Delaunay triangulations. In Geometric Modelling for Scientific Visualization, G. Brunnett, B. Hamann, and H. Mueller, Eds. Springer-Verlag.
15. LEE, D., AND LIN, A. 1986. Generalized Delaunay triangulation for planar graphs. Discrete and Computational Geometry 1, 201-217.
16. NVIDIA, 2011. NVIDIA CUDA C Programming Guide, Version 4.0. http://developer.download.nvidia.com/compute/DevZone/docs/html/C/doc/ CUDA-C-Programming Guide.pdf.
17. PRASAD, L., AND SKOURIKHINE, A. N. 2006. Vectorized image segmentation via trixel agglomeration. Pattern Recognition 39 (April), 501-514.
18. RONG, G., TAN, T.-S., CAO, T.-T., AND STEPHANUS. 2008. Computing two-dimensional Delaunay triangulation using graphics hardware. In I3D '08: Proc. Symp. Interactive 3D Graphics and Games, ACM, New York, NY, USA, 89-97.
19. SHEWCHUK, J. 1996. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied Computational Geometry Towards Geometric Engineering, M. Lin and D. Manocha, Eds., vol. 1148 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 203-222.
20. SHEWCHUK, J. R. 1996. Robust adaptive floating-point geometric predicates. ACM, New York, NY, USA, SoCG '96, 141-150.
21. SU, P., AND SCOT DRYSDALE, R. L. 1997. A comparison of sequential Delaunay triangulation algorithms. Computational Geometry: Theory and Applications 7 (April), 361-385.