Análisis Comparativo de Algoritmos para Obtener Triangulaciones Delaunay
Abstract
The best way to obtain 2-D or 3-D Delaunay triangulation is to use the Watson incremental algorithm. In the current work we perform a detailed analysis of different implementations of it, paying special atention to the robustness, and computational cost.
We also present an algorithm for the boundary regeneration in 2-D, that can solve any situation and produce elements with the best posible quality.
We also present an algorithm for the boundary regeneration in 2-D, that can solve any situation and produce elements with the best posible quality.
Full Text:
PDFAsociación Argentina de Mecánica Computacional
Güemes 3450
S3000GLN Santa Fe, Argentina
Phone: 54-342-4511594 / 4511595 Int. 1006
Fax: 54-342-4511169
E-mail: amca(at)santafe-conicet.gov.ar
ISSN 2591-3522