Show simple item record

dc.contributor.authorKorotov, S.
dc.contributor.authorPlaza A
dc.contributor.authorSuárez, J.P.
dc.date.accessioned2016-06-13T13:11:51Z
dc.date.available2016-06-13T13:11:51Z
dc.date.issued2015-12-31
dc.identifier.issn0167-8396
dc.identifier.urihttp://hdl.handle.net/20.500.11824/95
dc.description.abstractIn 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.formatapplication/pdf
dc.language.isoengen_US
dc.rightsReconocimiento-NoComercial-CompartirIgual 3.0 Españaen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/en_US
dc.subjectConforming longest-edge n-section
dc.subjectFinite element method
dc.subjectMaximum angle condition
dc.subjectMesh refinement
dc.subjectMinimum angle condition
dc.titleOn the maximum angle condition for the conforming longest-edge n-section algorithm for large values of nen_US
dc.typeinfo:eu-repo/semantics/otheren_US
dc.identifier.doi10.1016/j.cagd.2014.12.001
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0167839614001137
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen_US
dc.type.hasVersioninfo:eu-repo/semantics/acceptedVersionen_US
dc.journal.titleComputer Aided Geometric Designen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

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