Computing two-dimensional Delaunay triangulation using graphics hardware

Proceedings of the Symposium on Interactive 3D Graphics and Games, I3D 2008

Volumn , Issue , 2008, Pages 89-97

  Rong, Guodong ^a   Tan, Tiow Seng ^a   Cao, Thanh Tung ^a   Stephanus, ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Computational geometry; GPGPU; Graphics hardware; Voronoi diagram

Indexed keywords

DELAUNAY TRIANGULATION; GRAPHICS HARDWARE; GRAPHICS PROCESSING UNIT; PARALLEL COMPUTING; POINT SET; TOTAL WORK; VORONOI DIAGRAMS;

ARTS COMPUTING; COMPUTER GRAPHICS EQUIPMENT; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS; THREE DIMENSIONAL; THREE DIMENSIONAL COMPUTER GRAPHICS; TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 77950426155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1342250.1342264     Document Type: Conference Paper

References (17)

1. AURENHAMMER, F. 1991. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys 23, 3, 345-405.
2. BLELLOCH, G. E. 1990. Prefix sums and their applications. Tech. Rep. CMU-CS-90-190, School of Computer Science, Carnegie Mellon University, Nov.
3. DENNY, M. O. 2003. Algorithmic geometry via graphics hardware. PhD thesis, Universität des Saarlandes.
4. FISCHER, I., AND GOTSMAN, C. 2006. Fast approximation of high order Voronoi diagrams and distance transforms on the GPU. Journal of Graphics Tools 11, 4, 39-60.
5. FORTUNE, S. 1992. Voronoi diagrams and Delaunay triangulations. In Computing in Euclidean Geometry, D.-Z. Du and F. Hwang, Eds., vol.1 of Lecture Notes Series on Computing. World Scientific, Singapore, 163-172.
6. GRAHAM, R. L. 1972. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters 1, 4, 132-133.
7. HOFF III, K. E., CULVER, T., KEYSER, J., LIN, M., AND MANOCHA, D. 1999. Fast computation of generalized Voronoi diagrams using graphics hardware. In Proceedings of ACM SIGGRAPH 99, ACM Press / ACM SIGGRAPH, New York, 277-286. Computer Graphics Proceedings, Annual Conference Series, ACM.
8. KANG, D.-S., KIM, Y.-J., AND SHIN, B.-S. 2006. Efficient large-scale terrain rendering method for real-world game simulation. In Edutainment, 597-605.
9. 3 for computers with shared memory. Parallel Computing 31, 5, 491-522.
10. LANCTOT, M., SUN, N. N. M., AND VERBRUGGE, C. 2006. Path-finding for large scale multiplayer computer games. In Proceedings of the Second North American Game-On Conference.
11. MARK, W. R., GLANVILLE, R. S., AKELEY, K., AND KILGARD, M. J. 2003. Cg: a system for programming graphics hardware in a C-like language. ACM Transactions on Graphics 22, 3, 896-907.
12. NVIDIA, 2007. NVIDIA CUDA compute unified device architecture programming guide, Jan. http://developer. nvidia.com/cuda.
13. RONG, G., AND TAN, T.-S. 2006. Jump flooding in GPU with applications to Voronoi diagram and distance transform. In Proceedings of the Symposium on Interactive 3D Graphics and Games, ACM Press, 109-116.
14. RONG, G., AND TAN, T.-S. 2007. Variants of jump flooding algorithm for computing discrete Voronoi diagrams. In Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD'07), 176-181.
15. SHEWCHUK, J. R. 1996. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied Computational Geometry: Towards Geometric Engineering, M. C. Lin and D. Manocha, Eds., vol.1148 of Lecture Notes in Computer Science. Springer-Verlag, 203-222. See also http://www.cs.cmu.edu/ ~quake/triangle.html.
16. SU, P., AND DRYSDALE, R. L. S. 1995. A comparison of sequential Delaunay triangulation algorithms. In Symposium on Computational Geometry, 61-70.
17. YAMAMOTO, O. 2004. Fast computation of 3-dimensional convex hulls using graphics hardware. In Proceedings of International Symposium on Voronoi Diagrams in Science and Engineering, 179-190.