Repositorio de producción científica de la Universidad de Sevilla

There are simple and robust refinements (almost) as good as Delaunay

Opened Access There are simple and robust refinements (almost) as good as Delaunay

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Márquez Pérez, Alberto
Moreno González, Auxiliadora
Plaza, Ángel
Suárez, José P.
Departamento: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Fecha: 2014
Publicado en: Mathematics and Computers in Simulation, 106, 84-94.
Tipo de documento: Artículo
Resumen: A new edge-based partition for triangle meshes is presented, the Seven Triangle Quasi-Delaunay partition (7T-QD). The proposed partition joins together ideas of the Seven Triangle Longest-Edge partition (7T-LE), and the classical criteria for constructing Delaunay meshes. The new partition performs similarly compared to the Delaunay triangulation (7T-D) with the benefit of being more robust and with a cheaper cost in computation. It will be proved that in most of the cases the 7T-QD is equal to the 7T-D. In addition, numerical tests will show that the difference on the minimum angle obtained by the 7T-QD and by the 7T-D is negligible.
Tamaño: 1.270Mb
Formato: PDF

URI: http://hdl.handle.net/11441/38831

DOI: http://dx.doi.org/10.1016/j.matcom.2012.06.001

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones