The size of spanning disks for polygonal curves

DOI10.1007/S00454-002-2707-6zbMATH Open1015.57008arXivmath/9906197OpenAlexW2017477785WikidataQ56970655 ScholiaQ56970655MaRDI QIDQ1864124FDOQ1864124

Authors: Joel R. Hass, William P. Thurston, Jack Snoeyink 

Publication date: 17 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Let $K$ be a closed polygonal curve in $R{R}^3$ consisting of $n$ line segments. Assume that $K$ is unknotted, so that it is the boundary of an embedded disk in $R{R}^3$. 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 $K_n$ in $R^3$ having less than $10n+9$ edges, with the property that any Piecewise-Linear triangulated disk spanning the curve contains at least $2^{n-1}$ triangles.

Full work available at URL: https://arxiv.org/abs/math/9906197

Recommendations

• Disc-polygonal approximations of planar spindle convex sets
• Mean convex hulls and least area disks spanning extreme curves
• On geometric spanners of Euclidean and unit disk graphs
• Approximation of convex discs by polygons
• Area inequalities for embedded disks spanning unknotted curves
• Approximating the packedness of polygonal curves
• Approximating the Packedness of Polygonal Curves
• The geodesic diameter of polygonal domains
• The geodesic diameter of polygonal domains
• Disks in curves of bounded convex curvature

zbMATH Keywords

Morse theoryinvariant train trackspanning disk

Mathematics Subject Classification ID

Differential topology (57R99) General low-dimensional topology (57M99) PL-topology (57Q99) Smooth approximations in differential topology (57R12)

Cited In (16)

• Complexity of triangulations of the projective space.
• 3-manifolds efficiently bound 4-manifolds
• Title not available (Why is that?)
• Algorithms for contractibility of compressed curves on 3-manifold boundaries
• How to make a triangulation of $S^3$ polytopal
• Hard Diagrams of the Unknot
• ENGEL RELATIONS IN 4-MANIFOLD TOPOLOGY
• Title not available (Why is that?)
• Non-orientable fundamental surfaces in Lens spaces
• Area inequalities for embedded disks spanning unknotted curves
• A polynomial upper bound on Reidemeister moves
• Filling triangulated surfaces
• The efficient certification of knottedness and Thurston norm
• Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle
• Cuts for 3-D magnetic scalar potentials: visualizing unintuitive surfaces arising from trivial knots
• Mean convex hulls and least area disks spanning extreme curves

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)