Show simple item record

dc.contributor.authorMitchell, Scott A.en_US
dc.contributor.authorVavasis, Stephen A.en_US
dc.date.accessioned2007-04-04T16:32:20Z
dc.date.available2007-04-04T16:32:20Z
dc.date.issued1996-12en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.tc/96-266en_US
dc.identifier.urihttps://hdl.handle.net/1813/5596
dc.description.abstractWe consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a qradtree-based algorithm that can triangulate any polyhedral region including nonconvexregions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation provided that the input domain itself has no sharp angles. Finally, our algorithm is guaranteed never to over refine the domain in the sense that the number of simplices produced by QMG is bounded above by a factor times the number produced by any competing algorithm, where the factor depends on the aspect ratio bound satisfied by the competing algorithm. The QMG algorithm has been implemented in C++ and is used as a mesh generator for the finite element method.en_US
dc.format.extent455119 bytes
dc.format.extent388219 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjecttheory centeren_US
dc.titleQuality Mesh Generation in Higher Dimensionsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics