Show simple item record

dc.contributor.authorMitchell, Scott A.en_US
dc.contributor.authorVavasis, Stephen A.en_US
dc.date.accessioned2007-04-04T16:14:13Z
dc.date.available2007-04-04T16:14:13Z
dc.date.issued1995-11en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.tc/95-223en_US
dc.identifier.urihttps://hdl.handle.net/1813/5558
dc.description.abstractWe consider the problem of triangulating a d-dimensional uniform grid of d-cubes that is cut by a k-dimensional affine subspace. The goal is to obtain a triangulation with bounded aspect ratio. To achieve this goal, we allow some of the box faces near the affine subspace to be displaced. This problem has applications to finite element mesh generation. For general d and k, the bound on aspect ratio that we attain is double-exponential in d. For the important special case of d = 3, the aspect ratio bound is small enough that the technique is useful in practice.en_US
dc.format.extent245347 bytes
dc.format.extent339340 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjecttheory centeren_US
dc.titleAn Aspect Ratio Bound for Triangulating a d-grid Cut by a Hyperplaneen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics