The size of spanning disks for polygonal curves

From MaRDI portal
(Redirected from Publication:1864124)




Abstract: Let K be a closed polygonal curve in RR3 consisting of n line segments. Assume that K is unknotted, so that it is the boundary of an embedded disk in RR3. This paper considers the question: How many triangles are needed to triangulate a Piecewise-Linear (PL) spanning disk of K? The main result exhibits a family of unknotted polygons with n edges, noinfty, such that the minimal number of triangles needed in any triangulated spanning disk grows exponentially with n. For each integer nge0, there is a closed, unknotted, polygonal curve Kn in R3 having less than 10n+9 edges, with the property that any Piecewise-Linear triangulated disk spanning the curve contains at least 2n1 triangles.









This page was built for publication: The size of spanning disks for polygonal curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864124)