Greedy optimal homotopy and homology generators

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 1038-1046

  Erickson, Jeff ^a   Whittlesey, Kim ^b  

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

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

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRIC PROBLEMS; GREEDY ALGORITHMS; GREEDY OPTIMAL HOMOTOPY; HOMOLOGY GENERATORS;

BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; TOPOLOGY; TREES (MATHEMATICS);

ALGORITHMS;

EID: 20844459460     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. B. Chazelle. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 47:1028-1047, 2000.
3. J. Chen and Y. Han. Shortest paths on a polyhedron. Internat. J. Comput. Geom. Appl. 6:127-144, 1996.
4. W. Chen. On vector spaces associated with a graph. SIAM J. Appl. Math. 20(3):526-529, 1971.
5. E. Colin de Verdière and F. Lazarus. Optimal systems of loops on an orientable surface. Proc. 43rd Annu. IEEE Sympos. Found. Comput. Sci., 627-636, 2002. Full version to appear in Discrete Comput. Geom.
6. È. Colin de Verdière and F. Lazarus. Optimal pants decompositions and shortest homotopic cycles on an orientable surface. Proc. 11th Sympos. Graph Drawing, 478-490, 2003. Lecture Notes Comput. Sci. 2912, Springer-Verlag.
7. D. Eppstein. Dynamic generators of topologically embedded graphs. Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, 599-608, 2004.
8. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom. 31:37-59, 2004.
9. S. Gallot, D. Hulin, and J. Lafontaine. Riemannian Geometry. Springer-Verlag, 1987.
10. J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan. A separation theorem for graphs of bounded genus. J. Algorithms 5:391-407, 1984.
11. A. Hatcher. Algebraic Topology. Cambridge University Press, 2001. (http://www.math.cornell. edu/~hatcher/).
12. M. R. Henzinger, P. N. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences 55(1):3-23, 1997.
13. J. Holm, K. de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4):723-760, 2001.
14. J. D. Horton. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput. 16(2):358-366, 1987.
15. B. Kaneva and J. O'Rourke. An implementation of Chen & Han's shortest paths algorithm. Proc. 12th Canadian Conf. Comput. Geom., 139-146, 2000. (http://www.cs.unb.ca/conf/cccg/eProceedings/).
16. S. Kapoor. Efficient computation of geodesic shortest paths. Proc. 32nd Annu. ACM Sympos. Theory Comput., 770-779, 1999.
17. D. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42:321-328, 1995.
18. J. R. Keller. Spectral partitioning, eigenvalue bounds, and circle packings or graphs of bounded genus. Proc. 36th Annu. ACM Sympos. Theory Comput., 455-464, 2004.
19. R. Kimmel, A. Amir, and A. M. Bruckstein. Finding shortest paths on surfaces using level sets propogation. IEEE Trans. PAMI 17:635-640, 1995.
20. R. Kimmel and J. A. Sethian. Computing geodesic paths on manifolds. Proc. Nat. Acad. Sci. 95(15):8431-8435, 1998.
21. F. Lazarus, M. Pocchiola, G. Vegter, and A. Verroust. Computing a canonical polygonal schema of an orientable triangulated surface. Proc. 17th Annu. ACM Sympos. Comput. Geom., 80-89, 2001.
22. D. W. Matula and R. R. Sokal. Properties of Gabriel graphs relevant to geographic variation research and clustering of points in the plane. Geogr. Anal. 12(3):205-222, 1980.
23. E. Miller and I. Pak. Metric combinatorics of convex polyhedra: Cut loci and nonoverlapping unfoldings. Preprint, December 2003.
24. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput. 16:647-668, 1987.
25. K. Polthier and M. Schmies. Straightest geodesies on polyhedra. Mathematical Visualization, 135-150, 1998. Springer Verlag.
26. J. A. Sethian and A. Vladimirsky. Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes. Proc. Nat. Acad. Sci. 97(11):5699-5703, 2000.
27. R. Sinclair and M. Tanaka. Loki: Software for computing cut loci. Experiment. Math. 11(1):1-25, 2002.
28. J. Stillwell. Classical Topology and Combinatorial Group Theory, 2nd edition. Graduate Texts in Mathematics 72. Springer-Verlag, 1993.
29. R. E. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics 44. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
30. J. N. Tsitsiklis. Efficient algorithms for globally optimal trajectories. IEEE Trans. Automatic Control 40:1528-1538, 1995.
31. G. Zigelman, R. Kimmel, and N. Kiryati. Texture mapping using surface flattening via multidimensional scaling. IEEE Trans. Visual. Comput. Graph. 8:198-207, 2001.