Skip to main content

Advertisement

Springer Nature Link
Log in

Computing shortest cycles using universal covering space

  • Original Article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

In this paper we generalize the shortest path algorithm to the shortest cycles in each homotopy class on a surface with arbitrary topology, utilizing the universal covering space (UCS) in algebraic topology. In order to store and handle the UCS, we propose a two-level data structure which is efficient for storage and easy to process. We also pointed several practical applications for our shortest cycle algorithms and the UCS data structure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Dey, T.K., Guha, S.: Transforming curves on surfaces. J. Comput. Syst. Sci. 58, 297–325 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dey, T.K., Schipper, H.: A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection. Discrete Comput. Geom. 14, 93–110 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  4. Erickson, J., Whittlesey, K.: Greedy optimal homotopy and homology generators. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1038–1046 (2005)

  5. Floyd, R.W.: Algorithm 97 (shortest path). Commun. ACM 5(6), 345 (1962)

    Article  Google Scholar 

  6. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  7. Gu, X., Gortler, S., Hoppe, H.: Geometry images. In: Proceedings of the 29th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH), pp. 355–361 (2002)

  8. Gu, X., Yau, S.T.: Global conformal surface parameterization. In: Proceedings of the 1st ACM Symposium on Geometry Processing (SGP), pp. 127–137 (2003)

  9. Guskov, I., Wood, Z.: Topological noise removal. Graphics Interface, pp. 19–26 (2001)

  10. Hersberger, J., Snoeyink, J.: Around and around: computing the shortest loop. In: Proceedings of the 3rd Canadian Conference on Computational Geometry, pp. 157–161 (1991)

  11. Hersberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. 4(2), 63–97 (1994)

    Article  MathSciNet  Google Scholar 

  12. Jason, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM 24(1), 1–13 (1977)

    Article  Google Scholar 

  13. Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In: Proceedings of the 17th Annual ACM Symposium on Computational Geometry, pp. 80–89 (2001)

  14. Lee, Y., Lee, S.: Geometric snakes for triangular meshes. Comput. Graph. Forum 21(3), 229–238 (2002)

    Article  Google Scholar 

  15. Schipper, H.: Determining contractiblity of curves. In: Proceedings of the 8th ACM Symposium on Computational Geometry, pp. 358–367 (1992)

  16. Shoshan, A., Zwick, U.: All pairs shortest paths in undirected graphs with integer weights. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 605–614 (1999)

  17. Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46, 362–394 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  18. Vegter, G., Yap, C.: Computational complexity of combinatorial surfaces. In: Proceedings of the 6th ACM Symposium on Computational Geometry, pp. 102–111 (1990)

  19. Wood, Z., Hoppe, H., Desbrun, M., Schröder, P.: Removing excess topology from isosurfaces. ACM Trans. Graph. 23(2), 190–208 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, State University of New York at Stony Brook, Stony Brook, NY, 11790, USA

    Xiaotian Yin, Miao Jin & Xianfeng Gu

Authors
  1. Xiaotian Yin
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Miao Jin
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Xianfeng Gu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Xiaotian Yin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yin, X., Jin, M. & Gu, X. Computing shortest cycles using universal covering space. Visual Comput 23, 999–1004 (2007). https://doi.org/10.1007/s00371-007-0169-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-007-0169-9

Keywords