167 citations · 519 across the 84 of their papers we have counts for
4 papers · 1 filter
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…
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…
The Computational Complexity of Knot and Link Problems
Joel Hass, Jeffrey C. Lagarias, Nicholas Pippenger
We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that…
The number of Reidemeister Moves Needed for Unknotting
Joel Hass, Jeffrey C. Lagarias
There is a positive constant such that for any diagram representing the unknot, there is a sequence of at most Reidemeister moves that will convert it to a tr…