Sweep‐line algorithm for constrained Delaunay triangulation

References

• Anglada , M. V. 1997 . An improved incremental algorithm for constructing restricted Delaunay triangulation. . Computers and Graphics , 21 (2) : 215 – 223 .
   Google Scholar
• de Berg , M. , van Kreveld , M. , Overmars , M. and Schwarzkopf , O. 1997 . Computational Geometry, Algorithms and Applications , Berlin : Springer‐Verlag .
   Google Scholar
• Bilgili , A. , Smith , K. W. and Lynch , D. R. 2006 . BatTri: a two‐dimensional bathymetry‐based unstructured triangular grid generator for finite element circulation modeling. . Computers and GeoSciences , 32 (5) : 632 – 642 .
   Google Scholar
• Chew , L. P. 1989 . Constrained Delaunay triangulations. . Algorithmica , 4 (1) : 97 – 108 .
   Google Scholar
• Delaunay B. 1934. Delaunay triangulation. Available online at: http://en.wikipedia.org/wiki/Delaunay_triangulation (accessed 25 May 2007)
   Google Scholar
• Edelsbrunner , H. and Seidel , R. 1986 . Voronoi diagrams and arrangements. . Discrete and Computational Geometry , 1 (1) : 25 – 44 .
   Google Scholar
• Fortune , S. J. 1987 . A sweepline algorithm for Voronoi diagrams. . Algorithmica , 2 : 153 – 174 .
   Web of Science ®Google Scholar
• Guibas , L. , Knuth , D. and Sharir , M. 1992 . Randomized incremental construction of Delaunay and Voronoi diagrams. . Algorithmica , 7 : 381 – 413 .
   Web of Science ®Google Scholar
• Kaučič , B. and Žalik , B. 2004 . K‐guarding of polyhedral terrain. . International Journal of Geographical Information Science , 18 (7) : 709 – 718 .
   Google Scholar
• Lawson , C. L. 1977 . “ Software for C 1 surface interpolation. ” . In Mathematical Software III , Edited by: Rice , J. R . 161 – 194 . New York, NY : Academic Press .
   Google Scholar
• Lee , D. T. and Schachter , B. J. 1980 . Two algorithms for constructing a Delaunay triangulation. . International Journal of Computer and Information Sciences , 9 (3) : 219 – 242 .
   Google Scholar
• Mücke , E. P. , Sias , I. and Zhu , B. 1996 . “ Fast randomized point location without preprocessing in two‐ and three‐dimensional Delaunay triangulatons. ” . In Proceedings of the 12th annual symposium on computational geometry , 274 – 283 . Philadelphia, PA : ACM Press .
   Google Scholar
• Saux , E. , Thibaud , R. , Ki‐Joune , L. and Min‐Hwan , K. 2004 . “ A new approach for a topographic feature‐based characterization of digital elevation data. ” . In Proceedings of 12th International Symposium of ACM GIS , 73 – 81 . Washington, DC : ACM Press .
   Google Scholar
• Shewchuk JR. 1999a. Triangle: a two‐dimensional quality mesh generator. Available online at: http://www.cs.cmu.edu/quake/triangle.html (accessed 22 July 2007)
   Google Scholar
• Shewchuk , J. R. 1999b . “ Sweep algorithms for constructing higher‐dimensional constrained Delaunay triangulations. ” . In Proceedings of the 16th annual symposium on Computational geometry , 350 – 359 . Hong Kong : ACM Press .
   Google Scholar
• Sparovek , G. and Schnug , E. 2001 . Temporal erosion‐induced soil degradation and yield loss. . Soil Science Society of America Journal , 65 (5) : 1479 – 1486 .
   Google Scholar
• Tse , R. O. C. , Gold , C. M. and Kidner , D. 2004 . “ An original way of building a TIN with complex urban structures. ” . In Proceedings of ISPRS 2004 – XXth Congress
   Google Scholar
• Zhang , H. Z. and Smirnov , A. V. 2005 . Node placement for triangular mesh generation by Monte Carlo simulation. . International Journal for Numerical Methods in Engineering , 2 (7) : 973 – 989 .
   Google Scholar
• Žalik , B. 2005 . An efficient sweep‐line Delaunay triangulation algorithm. . Computer‐Aided Design , 37 (10) : 1027 – 1038 .
   Google Scholar