A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection

Francisco Perdomo, Ángel Plaza, Eduardo Quevedo and José P. Suárez

Mathematics and Computers in Simulation (MATCOM), 2014, vol. 106, issue C, 95-108

Abstract: The Longest-Edge (LE) trisection of a triangle is obtained by joining the two points which divide the longest edge in three with the opposite vertex. If LE-trisection is iteratively applied to an initial triangle, then the maximum diameter of the resulting triangles is between two sharpened decreasing functions. This paper mathematically answers the question of how fast the diameters of a triangle mesh tend to zero as repeated trisection is performed, and completes the previous empirical studies presented in the MASCOT 2010 Meeting (Perdomo et al., 2010).

Keywords: Longest-edge; Triangle subdivision; Trisection; Mesh refinement; Finite element method (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475414001979
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:106:y:2014:i:c:p:95-108

DOI: 10.1016/j.matcom.2014.08.002

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().