Reconstructing domain boundaries within a given set of points, using Delaunay triangulation
暂无分享,去创建一个
[1] Tamal K. Dey,et al. A simple provable algorithm for curve reconstruction , 1999, SODA '99.
[2] Robert L. Scot Drysdale,et al. A Comparison of Sequential Delaunay Triangulation Algorithms , 1997, Comput. Geom..
[3] Borut Zalik,et al. Improvements to randomized incremental Delaunay insertion , 2002, Comput. Graph..
[4] Leonidas J. Guibas,et al. Randomized incremental construction of Delaunay and Voronoi diagrams , 1990, Algorithmica.
[5] Herbert Edelsbrunner,et al. Three-dimensional alpha shapes , 1992, VVS.
[6] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .
[7] Marc Vigo Anglada,et al. An improved incremental algorithm for constructing restricted delaunay triangulations , 1997, Comput. Graph..
[8] Kurt Mehlhorn,et al. Curve reconstruction: connecting dots with good reason , 1999, SCG '99.
[9] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.
[10] S. Sloan. A fast algorithm for generating constrained delaunay triangulations , 1993 .
[11] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.
[12] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[13] Rex A. Dwyer. A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time , 1986, SCG '86.