Optimal system of loops on an orientable surface

Discrete and Computational Geometry

Volumn 33, Issue 3, 2005, Pages 507-534

  De Verdiére, Éric Colin ^a   Lazarus, Francis ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITÉ DE POITIERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21244470393     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-004-1150-2     Document Type: Article

References (19)

1. S. Bespamyatnikh. Computing homotopic shortest paths in the plane. In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 609-617. ACM Press, New York, 2003.
2. H. R. Brahana. Systems of circuits on 2-dimensional manifolds. Annals of Mathematics, 23:144-168, 1921.
3. É. Colin de Verdière. Shortening of curves and decomposition of surfaces. Ph.D. thesis, University of Paris 7, Dec. 2003. Available at http://www.di.ens.fr/~colin/.
4. É. Colin de Verdière and F. Lazarus. Optimal system of loops on an orientable surface. In Proc. IEEE Symposium on Foundations of Computer Science, pages 627-636, 2002.
5. É. Colin de Verdière and F. Lazarus. Optimal pants decompositions and shortest homotopic cycles on an orientable surface. In Proc. 11th Symposium on Graph Drawing, pages 478-490. Volume 2912 of LNCS. Springer-Verlag, Berlin, 2003.
6. T. Dey and H. Schipper. A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection. Discrete & Computational Geometry, 14:93-110, 1995.
7. A. Efrat, S. Kobourov, and A. Lubiw. Computing homotopic shortest paths efficiently. In Proc. 10th European Symposium on Algorithms, pages 411-423, 2002.
8. D. Epstein. Curves on 2-manifolds and isotopies. Acta Mathematica, 115:83-107, 1966.
9. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete & Computational Geometry, 31(1):37-59, 2004.
10. M. Floater. Parametrization and smooth approximation of surface triangulations. Computer Aided Geometric Design, 14(3):231-250, 1997.
11. M. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1, part 1):3-23, 1997.
12. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. Computational Geometry: Theory and Applications, 4:63-98, 1994.
13. F. Lazarus, M. Pocchiola, G. Vegter, and A. Verroust. Computing a canonical polygonal schema of an orientable triangulated surface. In Proc. 17th Annual Symposium on Computational Geometry, pages 80-89, 2001.
14. R. Lyndon and P. Shupp. Combinatorial Group Theory. Volume 89 of A Series of Modern Surveys in Mathematics. Springer-Verlag, New York, 1977.
15. J. Maillot, H. Yahia, and A. Verroust. Interactive texture mapping. In SIGGRAPH 93, pages 27-34, 1993.
16. W. S. Massey. Algebraic Topology: An Introduction. Volume 56 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1977.
17. D. Piponi and G. Borshukov. Seamless texture mapping of subdivision surfaces by model pelting and texture blending. In SIGGRAPH 2000, pages 471-478, 2000.
18. J. Stillwell. Classical Topology and Combinatorial Group Theory. Springer-Verlag, New York, 1993.
19. G. Vegter and C. K. Yap. Computational complexity of combinatorial surfaces. In. Proc. 6th Annual ACM Symposium on Computational Geometry, pages 102-111, 1990.