New Results on LEPP-delaunay Algorithm for Quality Triangulations | Zendy

Carlos Bedregal | Zendy; Maŕıa-Cecilia Rivara | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

New Results on LEPP-delaunay Algorithm for Quality Triangulations

Author(s) -

Carlos Bedregal,

Maŕıa-Cecilia Rivara

Publication year - 2015

Publication title -

procedia engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.32

H-Index - 74

ISSN - 1877-7058

DOI - 10.1016/j.proeng.2015.10.142

Subject(s) - delaunay triangulation , chew's second algorithm , ruppert's algorithm , bowyer–watson algorithm , algorithm , constrained delaunay triangulation , computer science , combinatorics , mathematics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research