Please use this identifier to cite or link to this item:
http://hdl.handle.net/10553/54884
Title: | There are simple and robust refinements (almost) as good as Delaunay | Authors: | Márquez, Alberto Moreno-González, Auxiliadora Plaza, Ángel Suárez, José P. |
UNESCO Clasification: | 120601 Construcción de algoritmos | Keywords: | Longest-Side Partition Mesh Generation Algorithms Quality Triangles, et al |
Issue Date: | 2014 | Journal: | Mathematics and Computers in Simulation | Abstract: | 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. | URI: | http://hdl.handle.net/10553/54884 | ISSN: | 0378-4754 | DOI: | 10.1016/j.matcom.2012.06.001 | Source: | Mathematics and Computers in Simulation [ISSN 0378-4754], v. 106, p. 84-94 |
Appears in Collections: | Artículos |
SCOPUSTM
Citations
2
checked on Mar 30, 2025
WEB OF SCIENCETM
Citations
1
checked on Mar 30, 2025
Page view(s)
117
checked on Jan 18, 2025
Google ScholarTM
Check
Altmetric
Share
Export metadata
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.