Reconstructing domain boundaries within a given set of points, using Delaunay triangulation

Computers and Geosciences

Volumn 32, Issue 9, 2006, Pages 1310-1319

  Kolingerová, Ivana ^a   Žalik, Borut ^b  

^a UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Boundary reconstruction; Computer graphics; GIS; Triangulation

Indexed keywords

COMPUTER GRAPHICS; GEOGRAPHIC INFORMATION SYSTEMS; HEURISTIC METHODS; SURVEYING;

BOUNDARY RECONSTRUCTION; DELAUNAY TRIANGLES; DOMAIN BOUNDARIES;

TRIANGULATION;

COMPUTER GRAPHICS; GEOGRAPHIC INFORMATION SYSTEMS; HEURISTIC METHODS; SURVEYING; TRIANGULATION;

GIS; GRAPHICAL METHOD; TRIANGULATION;

EID: 33747334405     PISSN: 00983004     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cageo.2005.12.004     Document Type: Article

References (13)

1. Anglada M.V. An improved incremental algorithm for constructing restricted Delaunay triangulations. Computers & Graphics 21 (1997) 215-223
2. de Berg M., van Kreveld M., Overmars M., and Schwarzkopf O. Computational geometry. Algorithms and Applications (1997), Springer, Berlin 367pp
3. Dey, T.K., Kumar, P., 1999. A simple provable algorithm for curve reconstruction. In: Proceedings ACM-SIAM Symposium on Discrete Algorithms, pp. 893-894.
4. Dey T.K., Mehlhorn K., and Ramos E.A. Curve reconstruction: connecting dots with good reason. Computational Geometry: Theory and Applications 15 4 (2000) 229-244
5. Dwyer, R.A., 1986. A Simple divide-and-conquer algorithm for constructing Delaunay triangulation in O(n log log n) expected time. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 276-284.
6. Edelsbrunner H., and Mücke E.P. Three-dimensional alpha shapes. ACM Transactions on Graphics 13 1 (1994) 43-72
7. Fortune S.J. A sweepline algorithm for Voronoi diagrams. Algorithmica 2 (1987) 153-174
8. Guibas L.J., Knuth D.E., and Sharir M. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7 (1992) 381-413
9. Kolingerová I., and Žalik B. Improvements to randomized incremental Delaunay insertion. Computers & Graphics 26 (2002) 477-490
10. O'Rourke J. Computational Geometry in C (1994), Cambridge University Press, New York, NY 392pp
11. Sloan S.W. A fast algorithm for generating constrained Delaunay triangulations. Computers & Structures 47 (1993) 441-450
12. Su, P., Drysdale, R.L.S., 1995. A comparison of sequential Delaunay triangulation algorithms. In: Proceedings of the 11th Annual Symposium on Computational Geometry. ACM, New York, pp. 61-70.
13. Tipper J.C. Fast triangulation of planar domains. In: Hogart W.L., and Noye B.J. (Eds). Computational Techniques and Applications (1991), Hemisphere, New York, NY 193-200