摘要：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.
其他摘要：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.
