Fast approximating triangulation of large scattered datasets

Advances in engineering software

Volumn 30, Issue 6, 1999, Pages 389-400

  Weimer, H ^a   Warren, J ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; ERROR ANALYSIS; INTERPOLATION; LINEAR PROGRAMMING;

DELAUNAY TRIANGULATIONS; SCATTERED DATA APPROXIMATIONS; VORONOI DIAGRAMS;

SOFTWARE ENGINEERING;

EID: 0033137564     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-9978(98)00095-7     Document Type: Article

References (23)

1. Besl P.J. Active optical range imaging sensors. Machine Vision and Applications. 1:(2):1988;127-152.
2. Bowyer A. Computing dirichlet tessellations. The Computer Journal. 24(2):1981;162-166.
3. Delaunay B. Sur la sphère vide. Bulletin des l'Académie de Sciences de l'URSS, VII Série, Class des Sciences Mathématiques et Naturelles, 1934:793-800.
4. Dorbin M.B., Savit C.H. Introduction to geophysical prospecting, 4th ed. 1988;McGraw-Hill.
5. Dwyer R.A. A faster divide-and-conquer algorithm for constructing Delaunay triangulations. Algorithmica. 2:1987;137-151.
6. Edelsbrunner H. Algorithms in Combinatorial Geometry. 1987;Springer-Verlag.
7. Edelsbrunner H., Mücke E.P. Three-dimensional alpha shapes. ACM Transactions on Graphics. 13:(1):1994;43-72.
8. Floyd R.W. Algorithm 245: Treesort3. Communications of the ACM. 7:1964;701.
9. Hamann B. Data reduction scheme for triangulated surfaces. Computer Aided Geometric Design. 11:(2):1994;197-214.
10. Hoppe H. Progressive meshes. Rushmeier H. SIGGRAPH 96 Conference Proceedings, Annual Conference Series. 1996;99 ACM SIGGRAH, Addison Wesley.
11. Hoppe H., DeRose T., Duchamp T., McDonald J., Stuetzle W. Surface reconstruction from unorganized points. Computer Graphics. 26:(2):1992;71-78.
12. Hoppe H., DeRose T., Duchamp T., McDonald J., Stuetzle W. Mesh optimization. Computer Graphics. 1993;19-26.
13. Klein R, Liebich G, Straßer W. Mesh reduction with error control. In Proceedings Visualization 1996. IEEE Computer Society, 1996:311-318.
14. Lee D.T., Schachter B.J. Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Sciences. 9:(3):1980;219-242.
15. Lorensen B, Kikinis R, Flynn J, Kaufman A, Napel S. Surface rendering versus volume rendering in medical imaging: Techniques and applications. In Proceedings Visualization 1996. IEEE Computer Society, 1996:439-440.
16. Margaliot M, Gotsman C. Piecewise-linear surface approximation from noisy scattered samples. In: Proceedings Visualization 1994. IEEE Computer Society, 1994:61-68.
17. Preparata F.P., Shamos M.I. Computational Geometry-an introduction. 1985;Springer-Verlag.
18. Rippa S. Minimal roughness property of the Delaunay triangulation. Computer Aided Geometric Design. 7:1990;489-497.
19. Schroeder J. William, Zarge Jonathan A., Lorensen William E. Decimation of triangle meshes. Computer Graphics. 26:(2):1992;65-70.
20. Thie P.R. An introduction to linear programming and game theory. 1988;Wiley.
21. Turk G. Re-tiling polygonal surfaces. Computer Graphics. 26:(2):1992;55-64.
22. Turk G, Levoy M. Zippered polygon meshes from range images. In: Glassner A, editor. Proceedings of SIGGRAPH '94, Orlando, FL, 24-29 July 1994. Computer Graphics Proceedings, Annual Conference Series. ACM SIGGRAPH, ACM Press, July 1994:311-314. ISBN 0-8791-667-0.
23. Weimer H, Warren J, Troutner J, Wiggins W, Shrout J. Efficient co-triangulation of large data sets. In: Rushmeyer H, Ebert D, Hagen H, editors. Proceedings IEEE Visualization 1998:119-126 and 526.