Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problem

CAD Computer Aided Design

Volumn 33, Issue 3, 2001, Pages 263-277

  Rivara, M C ^a   Hitschfeld, N ^a   Simpson, B ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY;

DELAUNAY ALGORITHMS; OPTIMAL QUALITY TRIANGULATION;

COMPUTER AIDED DESIGN;

EID: 0035281721     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(00)00125-1     Document Type: Article

References (23)

1. Rivara M.C. Algorithms for refining triangular grids stuitable for adative and multigrid techniques. International Journal for Numerical Methods in Engineering. 20:1984;745-756.
2. Rivara M.C. Selective refinement/derefinement algorithms for sequences of nested triangulations. International Journal for Numerical Methods in Engineering. 28:1989;2889-2906.
3. Rivara M.C., Levin C., 3d A. Refinement Algorithm for adaptive and multigrid Techniques. Communications in Applied Numerical Methods. 8:1992;281-290.
4. Rivara M.C., Iribarren G. The 4-triangles longest-side partition of triangles and linear refinement algorithms. Mathematics of Computtion. 65:(216):1996;1485-1501.
5. Rivara M.R., Venere M. Cost analysis of the longest-side (triangle bisection) refinement algorithms for triangulations. Engineering with Computers. 12:1996;224-234.
6. Baker B.S., Grosse E.H., Rafferty C.S. Non-obtuse triangulation of polygons. Journal of Discoveries in Computational Geometry. 3:1988;147-168.
7. Bern M., Epstein D. Du D.Z., Hwang F.K. Mesh generation and optimal triangulation. 1992;World Scientific, Singapore.
8. Bern M, Epstein D, Gilbert J. Provably good mesh generation. Proceedings of the 31st Annual Symposium on Foundations of Computer Science. New York: IEEE, 1990. p. 384-09.
9. Melissaratos E, Souvaine D. Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes. Proceedings of the Eight Annual Symposium on Computational Geometry. New York: ACM, 1992. p. 202-11.
10. Mitchell S, Vavasis S. Quality mesh generation in three dimensions. Proceedings of the Eighth Annual Symposium on Computational Geometty. New York: ACM (Full version on Cornell Technical Report TR 92-1267), 1992. p. 212-21.
11. Hitschfeld N. Generalization of modified octrees for geometric modeling. Geometric modeling: theory and practice, the state of the art. Berlin: Springer, 1997. p. 260-72.
12. Chew L. Constrained delaunay triangulation. Algorithmica. 4:1994;97-108.
13. Chew L. Guaranteed-quality triangular meshes. Technical Report TR-89-983, Cornell University, 1989.
14. Ruppert J. A delaunay refinement algorithm for quality 2-d mesh generation. Journal of Algorithms. 18:1995;548-585.
15. Shewchk JR. Tetrahedral mesh generation by Delaunay refinement. Proceedings of the14th Annual ACM Symposium on Computational Geometry, 1998. p. 86-95.
16. Rivara MC. New mathematical tools and techniques for the refinement and/or improvement of unstructured triangulations. Proceedings of the Fifth International Meshing Roundtable. Pittsburgh, 1996. p. 77-86.
17. Rivara M.C. New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations. International Journal of Numerical Methods. 40:1997;3313-3324.
18. Rivara MC, Inostroza P. A discussion on mixed (longest side midpoint insertion) Delaunay techniques for the triangulation refinement problem. Proceedings of the Fourth International Meshing Roundtable. Albuquerque, 1995. p. 335-346.
19. Rivara M.C., Inostroza P. Using longest-side bisection techniques for the automatic refinement of Delaunay triangulations. International Journal for Numerical Methods in Engineering. 40:1997;581-597.
20. Rivara M.C., Palma M. New Lepp algorithms for quality polygon and volume triangulation: implementation issues and practical benhavior. Cannan S.A., Saigal S. Trends unstructured mesh generation. AMD vol. 220:1997;1-8 ASME, New York.
21. Rivara MC, Hitschfeld N. Lepp-Delaunay algorithm: a robust tool for producing size-optimal quality triangulations. Proceedings of the Eighth International Meshing Roundtable, October 1999. p. 205-20.
22. Sloan W. A fast algorithm for constructing delaunay triangulations in the plane. Advances in Engineering Software. 9:1987;34-55.
23. Sibson R. Locally equiangular triangulations. The Computer Journal. 21:1978;243-245.