The least spanning area of a knot and the optimal bounding chain problem

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 135-144

  Dunfield, Nathan M ^a   Hirani, Anil N ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Homology; Knot genus; Linear programming; Minimal surface; NP complete; Topology

Indexed keywords

3-DIMENSIONAL; 3-MANIFOLD; DESINGULARIZATION; HOMOLOGY; INTEGER COEFFICIENT; KNOT GENUS; KNOT THEORY; LINEAR PROGRAMMING FORMULATION; MINIMAL GENUS; MINIMAL SURFACE; NP-COMPLETE; NP-HARD; POLYNOMIAL-TIME;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; TOPOLOGY;

OPTIMIZATION;

EID: 79960195316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998218     Document Type: Conference Paper

References (28)

1. AGOL, I., HASS, J., AND THURSTON, W. The computational complexity of knot genus and spanning area. Trans. Amer. Math. Soc. 358, 9 (2006), 3821-3850. arXiv:math.GT/0205057, doi:10.1090/S0002-9947-05-03919-X. (Pubitemid 44328543)
2. BURTON, B. A. The complexity of the normal surface solution space. In SoCG '10: Proceedings of the 2010 annual symposiumon computational geometry (New York, NY, USA, 2010), ACM, pp. 201-209. doi:10.1145/1810959.1810995.
3. BURTON, B. A. Maximal admissible faces and asymptotic bounds for the normal surface solution space, 2010. Preprint 2010. arXiv:1004.2605.
4. BURTON, B. A. Optimizing the double descriptionmethod for normal surface enumeration. Math. Comp. 79, 269 (2010), 453-484. doi:10.1090/S0025-5718-09- 02282-0.
5. BURTON, B. A., HYAM RUBINSTEIN, J., AND TILLMANN, S. TheWeber-Seifert dodecahedral space is non-Haken. Trans. Amer.Math. Soc.. To appear. arXiv:0909.4625.
6. CHEN, C., AND FREEDMAN, D. Hardness results for homology localization. In ACM/SIAMSymposiumon Discrete Algorithms (2010), pp. 1594-1604.
7. DEY, T. K., HIRANI, A. N., AND KRISHNAMOORTHY, B. Optimal homologous cycles, total unimodularity, and linear programming. In STOC '10: Proceedings of the 42nd ACM Symposiumon Theory of Computing (New York, NY, USA, June 6-8 2010), ACM, pp. 221-230. Also available as preprint arXiv:1001.0338v1 [math.AT] on http://arxiv.org/abs/1001.0338. URL http://doi.acm.org/10.1145/1806689. 1806721,arXiv:1001.0338, doi:10.1145/1806689.1806721.
8. DIXON, J. D. Exact solution of linear equations using p-adic expansions. Numer.Math. 40, 1 (1982), 137-141. URL http://dx.doi.org/10.1007/BF01459082, doi:10.1007/BF01459082.
9. DOUGLAS, J. A method of numerical solution of the problem of Plateau. Ann. ofMath. (2) 29, 1-4 (1927/28), 180-188. URL http://dx.doi.org/10.2307/ 1967991, doi:10.2307/1967991.
10. DUNFIELD, N. M., AND GAROUFALIDIS, S. Incompressibility criteria for spun-normal surfaces. Preprint 2011, 37 pages. arXiv:1102.4588.
11. GAREY, M. R., AND JOHNSON, D. S. Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco, Calif., 1979.
12. GRADY, L. Minimal surfaces extend shortest path segmentationmethods to 3D. IEEE Transactions on Pattern Analysis andMachine Intelligence 32, 2 (February 2010), 321-334. doi:10.1109/TPAMI.2008.289.
13. HASS, J. Intersections of least area surfaces. Pacific J.Math. 152, 1 (1992), 119-123.
14. HASS, J., SNOEYINK, J., AND THURSTON, W. P. The size of spanning disks for polygonal curves. Discrete and Computational Geometry 29, 1 (March 2003), 1-17. URL http://dx.doi.org/10.1007/s00454-002-2707-6, doi:10.1007/s00454-002- 2707-6. (Pubitemid 36820367)
15. HILDEBRANDT, K., POLTHIER, K., AND WARDETZKY, M. On the convergence ofmetric and geometric properties of polyhedral surfaces. Geometriae Dedicata 123, 1 (December 2006), 89-112.
16. KIRASANOV, D., AND GORTLER, S. J. A discrete global minimization algorithm for continuous variational problems. Tech. Rep. TR-14-04, Harvard University, Department of Computer Science, 2004.
17. LYON, H. C. Incompressible surfaces in knot spaces. Trans. Amer.Math. Soc. 157 (1971), 53-62. URL.
18. MATVEEV, S. Algorithmic topology and classification of 3-manifolds, second ed., vol. 9 of Algorithms and Computation inMathematics. Springer, Berlin, 2007.
19. MORGAN, F. Geometric measure theory, fourth ed. Elsevier/Academic Press, Amsterdam, 2009. A beginner's guide.
20. MUNKRES, J. R. Elements of Algebraic Topology. Addison-Wesley Publishing Company,Menlo Park, 1984.
21. PARKS, H. R. Explicit determination of area minimizinghypersurfaces, II. Mem. Amer.Math. Soc. 60, 342 (1986),iv+90.
22. PARKS, H. R. Numerical approximation of parametric oriented area-minimizing hypersurfaces. SIAM J. Sci Statist. Comput. 13, 2 (1992), 499-511. doi:10.1137/0913027.
23. PARKS, H. R., AND PITTS, J. T. Computing least area hypersurfaces spanning arbitrary boundaries. SIAM J. Sci. Comput. 18, 3 (1997), 886-917. doi:10.1137/S1064827594278903. (Pubitemid 127640888)
24. PINKALL, U., AND POLTHIER, K. Computing discrete minimal surfaces and their conjugates. Experiment.Math. 2, 1 (1993), 15-36. URL http://projecteuclid. org/getRecord?id=euclid.em/1062620735.
25. POLTHIER, K. Computational aspects of discrete minimal surfaces. In Global theory of minimal surfaces, vol. 2 of Clay Math. Proc. Amer.Math. Soc., Providence, RI, 2005, pp. 65-111..
26. SCHAEFER, T. J. The complexity of satisfiability problems. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978). ACM, New York, 1978, pp. 216-226.
27. SULLIVAN, J. M. A Crystalline Approximation Theorem for Hypersurfaces. PhD thesis, Princeton University, 1990. URL.
28. VEINOTT, ARTHUR F., J., AND DANTZIG, G. B. Integral extreme points. SIAM Review 10, 3 (1968), 371-372. URL http://www.jstor.org/stable/2027662.