Showing 2002Show all
3 papers · 1 filter
math.GT2002
The Number of Triangles Needed to Span a Polygon Embedded in R^d
Joel Hass, Jeffrey C. Lagarias
Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d havin…
math.GT2002
The Computational Complexity of Knot Genus and Spanning Area
Ian Agol, Joel Hass, William P. Thurston
We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a…
math.GT2002
Affine isoperimetric inequalities for piecewise linear surfaces
Joel Hass, Jeffrey C. Lagarias
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give up…