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-26T20:00:52Z | |
Available date | dc.date.available | 2010-07-26T20:00:52Z | |
Publication date | dc.date.issued | 2010 | |
Cita de ítem | dc.identifier.citation | Computer-Aided Design 42 (2010) 58-66 | en_US |
Identifier | dc.identifier.other | doi:10.1016/j.cad.2008.11.004 | |
Identifier | dc.identifier.uri | https://repositorio.uchile.cl/handle/2250/125434 | |
Abstract | dc.description.abstract | We discuss Lepp-centroid versus Lepp-midpoint algorithms for Delaunay quality triangulation. We
present geometrical results that ensure that the centroid version produces triangulations with both
average smallest angles greater than those obtained with the midpoint version and with bigger smallest
edges, without suffering from a rare looping case associated to the midpoint method. Empirical study
shows that the centroid method behaves significantly better than the midpoint version (and than the offcenter
algorithm for angles bigger than 25 ), for geometries whose initial Delaunay triangulation have
triangle smallest edges over the boundary. | en_US |
Patrocinador | dc.description.sponsorship | This research was supported by DI ENL 07/03. We are grateful
to Bruce Simpson who contributed to an early formulation of this
paper. | en_US |
Lenguage | dc.language.iso | en | en_US |
Publisher | dc.publisher | ELSEVIER | en_US |
Keywords | dc.subject | Mesh generation | en_US |
Título | dc.title | Lepp terminal centroid method for quality triangulation | en_US |
Document type | dc.type | Artículo de revista | |