The computational Complexity of Knot and Link Problems (1999)

by Joel Hass , Jeffrey C. Lagarias
Venue:J. ACM
Citations:61 - 9 self

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
56 Theorie der Normalflächen – Wolfgang Haken - 1961
470 Three-dimensional alpha shapes – Herbert Edelsbrunner, Ernst P. Mücke - 1994
2429 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
9061 Introduction to Algorithms – Matteo Frigo, Volker Strumpen - 2009
2215 Robot Motion Planning – C Latombe - 1991
595 Decimation of triangle meshes – William J. Schroeder, Jonathan A. Zarge, William E. Lorensen - 1992
1019 Surface Simplification Using Quadric Error Metrics – Michael Garland, Paul S. Heckbert - 1997
692 Surface reconstruction from unorganized points – Hugues Hoppe, Tony DeRose, Tom Duchamp, John Mcdonald, Werner Stuetzle - 1992