Triangulations from topologically correct digital Voronoi diagrams

Computational Geometry - Tập 48 - Trang 507-519 - 2015
Thanh-Tung Cao1, Herbert Edelsbrunner2, Tiow-Seng Tan1
1School of Computing, National University of Singapore, Singapore
2Institute of Science and Technology, Klosterneuburg, Austria

Tài liệu tham khảo

Cao, 2010, Parallel banding algorithm to compute exact distance transform with the GPU, 83 Cuisenaire, 1999 Danielsson, 1980, Euclidean distance mapping, Comput. Graph. Image Process., 14, 227, 10.1016/0146-664X(80)90054-4 Edelsbrunner, 2009 Fortune, 1997, Voronoi diagrams and Delaunay triangulations, 377 Hoff, 1999, Fast computation of generalized Voronoi diagrams using graphics hardware, 277 Lee, 2010, An OpenCL framework for heterogeneous multicores with local memory, 193 Nickolls, 2008, Scalable parallel programming with CUDA, Queue, 6, 40, 10.1145/1365490.1365500 Owens, 2005, A survey of general-purpose computation on graphics hardware, 21 Qi, 2012, Computing 2D constrained Delaunay triangulation using the GPU, 39 Rong, 2006, Jump flooding in GPU with applications to Voronoi diagram and distance transform, 109 Rong, 2008, Computing two-dimensional Delaunay triangulation using graphics hardware, 89 Schneider, 2009, GPU-based real-time discrete Euclidean distance transforms with precise error bounds, 435 Shewchuk, 1996, Triangle: engineering a 2D quality mesh generator and Delaunay triangulator, vol. 1148, 203 Sud, 2006, Interactive 3D distance field computation using linear factorization, 117