On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n

dc.contributor.author	Korotov, S.
dc.contributor.author	Plaza A
dc.contributor.author	Suárez, J.P.
dc.date.accessioned	2016-06-13T13:11:51Z
dc.date.available	2016-06-13T13:11:51Z
dc.date.issued	2015-12-31
dc.identifier.issn	0167-8396
dc.identifier.uri	http://hdl.handle.net/20.500.11824/95
dc.description.abstract	In this note we introduce the conforming longest-edge $n$-section algorithm and show that for $n \ge 4$ it produces a family of triangulations which does not satisfy the maximum angle condition.
dc.format	application/pdf
dc.language.iso	eng	en_US
dc.rights	Reconocimiento-NoComercial-CompartirIgual 3.0 España	en_US
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/es/	en_US
dc.subject	Conforming longest-edge n-section
dc.subject	Finite element method
dc.subject	Maximum angle condition
dc.subject	Mesh refinement
dc.subject	Minimum angle condition
dc.title	On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n	en_US
dc.type	info:eu-repo/semantics/other	en_US
dc.identifier.doi	10.1016/j.cagd.2014.12.001
dc.relation.publisherversion	http://www.sciencedirect.com/science/article/pii/S0167839614001137
dc.rights.accessRights	info:eu-repo/semantics/openAccess	en_US
dc.type.hasVersion	info:eu-repo/semantics/acceptedVersion	en_US
dc.journal.title	Computer Aided Geometric Design	en_US

Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España