Meshing Roundtable ( IMR 24 ) New Results on LEPP-Delaunay Algorithm for Quality Triangulations

@inproceedings{Bedregal2015MeshingR,
  title={Meshing Roundtable ( IMR 24 ) New Results on LEPP-Delaunay Algorithm for Quality Triangulations},
  author={Carlos Bedregal and Cecilia Rivara},
  year={2015}
}
In this paper, we provide proofs of termination and size-optimality of the LEPP-Delaunay algorithm, for the quality generation of triangulations. We first prove that the algorithm cannot insert points arbitrarily close to each other. We also show that the algorithm terminates, producing well-graded triangulations with internal angles greater than 25.66 degrees for geometries with input constrained angles of at least 30 degrees. c © 2015 The Authors. Published by Elsevier Ltd. Peer-review under… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Tuned terminal triangles centroid Delaunay algorithm for quality triangulation

M. -C. Rivara, Pedro A. Rodriguez-Moreno
2018
View 6 Excerpts
Method Support
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 16 references

New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations

M.-C. Rivara
Int. Journal for Numerical Methods in Engineering 40 • 1997
View 6 Excerpts
Highly Influenced

Complexity of the bisection method

View 2 Excerpts
Highly Influenced

Analysis of Longest Edge Algorithms for 2-Dimensional Mesh Refinement

C. Bedregal
Technical Report, Department of Computer Science, University of Chile • 2015
View 1 Excerpt

Delaunay Mesh Generation

Chapman and Hall / CRC computer and information science series • 2012