Delaunay triangulation and its applications

[1]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[2]  M. McCullagh,et al.  Delaunay Triangulation of a Random Data Set for Isarithmic Mapping , 1980 .

[3]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[4]  Robin Sibson,et al.  Locally Equiangular Triangulations , 1978, Comput. J..

[5]  Glenn K. Manacher,et al.  Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation , 1979, Inf. Process. Lett..

[6]  Steven Skiena,et al.  Optimizing triangle strips for fast rendering , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[7]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

[8]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[9]  Enrico Puppo,et al.  Variable resolution triangulations , 1998, Comput. Geom..

[10]  S. Sloan.  A fast algorithm for constructing Delaunay triangulations in the plane , 1987 .

[11]  Leila De Floriani,et al.  A pyramidal data structure for triangle-based surface description , 1989, IEEE Computer Graphics and Applications.

[12]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[13]  Charles L. Lawson,et al.  Transforming triangulations , 1972, Discret. Math..

[14]  Andrzej Lingas.  The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete , 1983, FCT.

[15]  James J. Little,et al.  Automatic extraction of Irregular Network digital terrain models , 1979, SIGGRAPH.

[16]  Leila De Floriani,et al.  Compressing Triangulated Irregular Networks , 2000, GeoInformatica.

[17]  D. T. Lee,et al.  Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.

[18]  Jay Lee,et al.  Comparison of existing methods for building triangular irregular network, models of terrain from grid digital elevation models , 1991, Int. J. Geogr. Inf. Sci..

[19]  B. A. Lewis,et al.  Triangulation of Planar Regions with Applications , 1978, Comput. J..

[20]  Marvin Shapiro.  A note on lee and schachter's algorithm for delaunay triangulation , 2004, International Journal of Computer & Information Sciences.