Optimizing the double description method for normal surface enumeration

Mathematics of Computation

Volumn 79, Issue 269, 2010, Pages 453-484

  Burton, Benjamin A ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

Double description method; Normal surfaces; Vertex enumeration

Indexed keywords

EID: 72949098392     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-09-02282-0     Document Type: Article

References (34)

1. David Avis, A revised implementation of the reverse search vertex enumeration algorithm, Polytopes-Combinatorics and Computation (Oberwolfach, 1997), DMV Sem., vol. 29, Birkhäuser, Basel, 2000, pp. 177-198.
2. David Avis, David Bremner, and Raimund Seidel, How good are convex hull algorithms?, Comput. Geom. 7 (1997), no. 5-6, 265-301.
3. David Avis and Komei Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete Comput. Geom. 8 (1992), no. 3, 295-313.
4. Benjamin A. Burton, Regina: Normal surface and 3-manifold topology software, http://regina.sourceforge.net/, 1999-2009.
5. Benjamin A. Burton, Introducing Regina, the 3-manifold topology software, Experiment. Math. 13 (2004), no. 3, 267-272.
6. Benjamin A. Burton, Enumeration of non-orientable 3-manifolds using face-pairing graphs and unionfind, Discrete Comput. Geom. 38 (2007), no. 3, 527-571.
7. Benjamin A. Burton, Extreme cases in normal surface enumeration, In preparation, 2009.
8. Patrick J. Callahan, Martin V. Hildebrand, and Jeffrey R. Weeks, A census of cusped hyperbolic 3-manifolds,Math.Comp.68 (1999), no. 225, 321-332.
9. Marc Culler and Nathan Dunfield, FXrays: Extremal ray enumeration software, http:// www.math.uic.edu/~t3m/, 2002-2003.
10. Ulrich Drepper, What every programmer should know about memory, http://people.redhat.com/drepper/cpumemory.pdf, November 2007.
11. M. E. Dyer, The complexity of vertex enumeration methods, Math. Oper. Res. 8 (1983), no. 3, 381-402.
12. Komei Fukuda and Alain Prodon, Double description method revisited, Combinatorics and Computer Science (Brest, 1995), Lecture Notes in Comput. Sci., vol. 1120, Springer, Berlin, 1996, pp. 91-111.
13. Wolfgang Haken, Theorie der Normalflächen,ActaMath.105 (1961), 245-375.
14. Wolfgang Haken, Über das Homöomorphieproblem der 3-Mannigfaltigkeiten. I,Math.Z.80 (1962), 89-120.
15. Joel Hass, Jeffrey C. Lagarias, and Nicholas Pippenger, The computational complexity of knot and link problems, J. Assoc. Comput. Mach. 46 (1999), no. 2, 185-211.
16. Geoffrey Hemion, The classification of knots and 3-dimensional spaces, Oxford Science Publications, Oxford University Press, Oxford, 1992
17. Craig D. Hodgson and Jeffrey R. Weeks, Symmetries, isometries and length spectra of closed hyperbolic three-manifolds, Experiment. Math. 3 (1994), no. 4, 261-274.
18. William Jaco, David Letscher, and J. Hyam Rubinstein, Algorithms for essential surfaces in 3-manifolds, Topology and Geometry: Commemorating SISTAG, Contemporary Mathematics, no. 314, Amer. Math. Soc., Providence, RI, 2002, pp. 107-124.
19. William Jaco and Ulrich Oertel, An algorithm to decide if a 3-manifold is a Haken manifold, Topology 23 (1984), no. 2, 195-209.
20. William Jaco and J. Hyam Rubinstein, 0-efficient triangulations of 3-manifolds, J. Differential Geom. 65 (2003), no. 1, 61-168.
21. William Jaco, J. Hyam Rubinstein, and Stephan Tillmann, Coverings and minimal triangulations of 3-manifolds,Preprint,arXiv:0903.0112, February 2009.
22. William Jaco and Jeffrey L. Tollefson, Algorithms for the complete decomposition of a closed 3-manifold, Illinois J. Math. 39 (1995), no. 3, 358-406.
23. Ensil Kang and J. Hyam Rubinstein, Ideal triangulations of 3-manifolds I. Spun normal surface theory, Proceedings of the Casson Fest, Geom. Topol. Monogr., vol. 7, Geom. Topol. Publ., Coventry, 2004, pp. 235-265.
24. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, and Vladimir Gurvich, Generating all vertices of a polyhedron is hard, Discrete Comput. Geom. 39 (2008), no. 1-3, 174-190.
25. Hellmuth Kneser, Geschlossene Flächen in dreidimensionalen Mannigfaltigkeiten,Jahresbericht der Deut. Math. Verein. 38 (1929), 248-260.
26. Sergei V. Matveev, Tables of 3-manifolds up to complexity 6, Max-Planck-Institut für Mathematik Preprint Series (1998), no. 67, available from http://www.mpim-bonn.mpg.de/html/preprints/preprints.html.
27. P. McMullen, The maximum numbers of faces of a convex polytope,Mathematika17 (1970), 179-184.
28. T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall, The double description method, Contributions to the Theory of Games, Vol. II (H. W. Kuhn and A. W. Tucker, eds.), Annals of Mathematics Studies, no. 28, Princeton University Press, Princeton, NJ, 1953, pp. 51-73.
29. J. Hyam Rubinstein, An algorithm to recognize the 3-sphere, Proceedings of the International Congress of Mathematicians (Zürich, 1994), vol. 1, Birkhäuser, 1995, pp. 601-611.
30. J. Hyam Rubinstein, Polyhedral minimal surfaces, Heegaard splittings and decision problems for 3-dimensional manifolds, Geometric Topology (Athens, GA, 1993), AMS/IP Stud. Adv. Math., vol. 2, Amer. Math. Soc., 1997, pp. 1-20.
31. 3, Math. Res. Lett. 1 (1994), no. 5, 613-630.
32. Stephan Tillmann, Normal surfaces in topologically finite 3-manifolds, Enseign. Math. (2) 54 (2008), 329-380.
33. Jeffrey L. Tollefson, Normal surface Q-theory, Pacific J. Math. 183 (1998), no. 2, 359-374.
34. Henry S. Warren, Jr., Hacker's delight, Addison-Wesley, 2002.