| Author | dc.contributor.author | Rivara Zúñiga, María Cecilia | |
| Author | dc.contributor.author | Calderón, Carlo | es_CL |
| Admission date | dc.date.accessioned | 2010-07-26T19:51:34Z | |
| Available date | dc.date.available | 2010-07-26T19:51:34Z | |
| Publication date | dc.date.issued | 2010 | |
| Identifier | dc.identifier.uri | https://repositorio.uchile.cl/handle/2250/125433 | |
| Abstract | dc.description.abstract | We introduce a new Lepp-Delaunay algorithm for quality
triangulation. For every bad triangle t with smallest angle less than a
threshold angle θ, a Lepp-search is used to find an associated convex terminal
quadrilateral formed by the union of two terminal triangles which
share a local longest edge (terminal edge) in the mesh. The centroid of
this terminal quad is computed and Delaunay inserted in the mesh. The
algorithm improves the behavior of a previous Lepp-Delaunay terminal
edge midpoint algorithm. The centroid method computes significantly
smaller triangulation than the terminal edge midpoint variant, produces
globally better triangulations, and terminates for higher threshold angle
θ (up to 36◦). We present geometrical results which explain the better
performance of the centroid method. Also the centroid method behaves
better than the off-center algorithm for θ bigger than 25◦. | en_US |
| Patrocinador | dc.description.sponsorship | Research supported by DI ENL 07/03. We are grateful
with Bruce Simpson who contributed to an early formulation of this paper. | en_US |
| Lenguage | dc.language.iso | en | en_US |
| Keywords | dc.subject | mesh generation | en_US |
| Título | dc.title | Lepp Terminal Centroid Method for Quality Triangulation: A Study on a New Algorithm | en_US |
| Document type | dc.type | Artículo de revista | |
