Show simple item record

Authordc.contributor.authorRivara Zúñiga, María Cecilia 
Authordc.contributor.authorCalderón, Carlo es_CL
Admission datedc.date.accessioned2010-07-26T20:00:52Z
Available datedc.date.available2010-07-26T20:00:52Z
Publication datedc.date.issued2010
Cita de ítemdc.identifier.citationComputer-Aided Design 42 (2010) 58-66en_US
Identifierdc.identifier.otherdoi:10.1016/j.cad.2008.11.004
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/125434
Abstractdc.description.abstractWe 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
Patrocinadordc.description.sponsorshipThis 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
Lenguagedc.language.isoenen_US
Publisherdc.publisherELSEVIERen_US
Keywordsdc.subjectMesh generationen_US
Títulodc.titleLepp terminal centroid method for quality triangulationen_US
Document typedc.typeArtículo de revista


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record