Delaunay triangulation algorithms useful for multibeam echosounding

Journal of Surveying Engineering

Volumn 129, Issue 2, 2003, Pages 79-84

  Brouns, Gert ^a   De Wulf, Alain ^a   Constales, Denis ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Algorithms; Hydrographs; Mathematical models; Topography; Triangulation

Indexed keywords

ALGORITHMS; ECHO SUPPRESSION; IMAGE RECONSTRUCTION;

SURFACE REPRESENTATION;

TRIANGULATION;

ALGORITHM; SEAFLOOR MAPPING; TOPOGRAPHIC MAPPING; TRIANGULATION;

EID: 0038404746     PISSN: 07339453     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0733-9453(2003)129:2(79)     Document Type: Article

References (16)

1. Cressie, N. (1993). Statistics for spatial data, revised Ed., Wiley, New York.
2. Dwyer, R. A. (1987). "A faster divide-and-conquer algorithm for constructing Delaunay triangulations." Algorithmica, 2(2), 137-151.
3. Fortune, S. (1987). "A sweepline algorithm for Voronoi diagrams." Algorithmica, 2, 153-174.
4. Guibas, L., Knuth, E., and Sharir, M. (1992). "Randomized incremental construction of Delaunay and Voronoi diagrams." Algorithmica, 7, 381-413.
5. Guibas, L., and Stolfi, J. (1985). "Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams." ACM Trans. Graphics, 4(2), 74-123.
6. Harel, D. (1987). "The efficiency of algorithms." Algorithmics. The spirit of computing, Addison-Wesley, Workingham, England, 119-147.
7. Lawson, C. L. (1972). "Transforming triangulations." Discrete Math., 3, 365-372.
8. Lee, D. T., and Schachter, B. J. (1980). "Two algorithms for constructing a Delaunay triangulation." Int. J. Comput. Inf. Sci., 9(3), 219-242.
9. Mirante, A., and Weingarten, N. (1982). "The radial sweep algorithm for constructing triangulated irregular networks." IEEE Comput. Graphics Appl., 2(3), 11-21.
10. Okabe, A., Boots, B., Sugihara, K., and Chiu, S. N. (1999). Spatial tessellations: Concepts and applications of Voronoi diagrams, 2nd Ed., Wiley, New York.
11. O'Rourke, J. (1998). Computational geometry in C, 2nd Ed., Cambridge University Press, Cambridge, England.
12. Shamos, M. I., and Hoey, D. (1975). "Closest point problems." Proc., 16th Annual IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Berkeley, Calif., 151-162.
13. Shewchuck, J. R. (1996). "Triangulation algorithms and data structures." (http://www.cs.cmu.edu/~quake/tripaper/triangle2.html).
14. Sibson, R. (1979). "Locally equiangular triangulations." Comput. J. (UK), 21, 243-245.
15. Su, P., and Drysdale, R. L. S. (1996). "A comparison of sequential Delaunay triangulation algorithms." (http://www.cs.berkeley.edu/~jrs/mesh/present.html).
16. Watson, D. F. (1981). "Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes." Comput. J. (UK , 24(2), 167-172.