The optimum method for building delaunay triangulation based on the Virtual Grid
暂无分享,去创建一个
[1] D. T. Lee,et al. Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.
[2] Nickolas S. Sapidis,et al. Delaunay triangulation of arbitrarily shaped planar domains , 1991, Comput. Aided Geom. Des..
[3] Victor J. D. Tsai,et al. Delaunay Triangulations in TIN Creation: An Overview and a Linear-Time Algorithm , 1993, Int. J. Geogr. Inf. Sci..
[4] Wu Xiao. A Hybridized Method for Building Delaunay Triangulation , 2000 .
[5] Chen Tingting. Research and Improvement of Convex Hull Algorithm in Construction of Delaunay Triangulation , 2007 .
[6] Peter Schröder,et al. An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing , 2006, Computing.
[7] Pla Uni,et al. Fast Improved Delaunay Triangulation Algorithm , 2006 .
[8] Guy E. Blelloch,et al. Engineering a compact parallel delaunay algorithm in 3D , 2006, SCG '06.
[9] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[10] Alper Üngör,et al. A time-optimal delaunay refinement algorithm in two dimensions , 2005, SCG.