{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:47:17Z","timestamp":1742392037068},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T00:00:00Z","timestamp":1186704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Visual Comput"],"published-print":{"date-parts":[[2007,11,16]]},"DOI":"10.1007\/s00371-007-0169-9","type":"journal-article","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T15:46:22Z","timestamp":1186674382000},"page":"999-1004","source":"Crossref","is-referenced-by-count":12,"title":["Computing shortest cycles using universal covering space"],"prefix":"10.1007","volume":"23","author":[{"given":"Xiaotian","family":"Yin","sequence":"first","affiliation":[]},{"given":"Miao","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Xianfeng","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,8,10]]},"reference":[{"key":"169_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1006\/jcss.1998.1619","volume":"58","author":"T.K. Dey","year":"1999","unstructured":"Dey, T.K., Guha, S.: Transforming curves on surfaces. J. Comput. Syst. Sci. 58, 297\u2013325 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"169_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02570697","volume":"14","author":"T.K. Dey","year":"1995","unstructured":"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\u2013110 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"169_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"169_CR4","unstructured":"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\u20131046 (2005)"},{"issue":"6","key":"169_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97 (shortest path). Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"169_CR6","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"169_CR7","doi-asserted-by":"crossref","unstructured":"Gu, X., Gortler, S., Hoppe, H.: Geometry images. In: Proceedings of the 29th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH), pp. 355\u2013361 (2002)","DOI":"10.1145\/566570.566589"},{"key":"169_CR8","unstructured":"Gu, X., Yau, S.T.: Global conformal surface parameterization. In: Proceedings of the 1st ACM Symposium on Geometry Processing (SGP), pp. 127\u2013137 (2003)"},{"key":"169_CR9","unstructured":"Guskov, I., Wood, Z.: Topological noise removal. Graphics Interface, pp. 19\u201326 (2001)"},{"key":"169_CR10","unstructured":"Hersberger, J., Snoeyink, J.: Around and around: computing the shortest loop. In: Proceedings of the 3rd Canadian Conference on Computational Geometry, pp. 157\u2013161 (1991)"},{"issue":"2","key":"169_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J. Hersberger","year":"1994","unstructured":"Hersberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. 4(2), 63\u201397 (1994)","journal-title":"Comput. Geom."},{"issue":"1","key":"169_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D.B. Jason","year":"1977","unstructured":"Jason, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM 24(1), 1\u201313 (1977)","journal-title":"J. ACM"},{"key":"169_CR13","doi-asserted-by":"crossref","unstructured":"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\u201389 (2001)","DOI":"10.1145\/378583.378630"},{"issue":"3","key":"169_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1111\/1467-8659.t01-1-00582","volume":"21","author":"Y. Lee","year":"2002","unstructured":"Lee, Y., Lee, S.: Geometric snakes for triangular meshes. Comput. Graph. Forum 21(3), 229\u2013238 (2002)","journal-title":"Comput. Graph. Forum"},{"key":"169_CR15","doi-asserted-by":"crossref","unstructured":"Schipper, H.: Determining contractiblity of curves. In: Proceedings of the 8th ACM Symposium on Computational Geometry, pp. 358\u2013367 (1992)","DOI":"10.1145\/142675.142749"},{"key":"169_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013614 (1999)","DOI":"10.1109\/SFFCS.1999.814635"},{"key":"169_CR17","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/316542.316548","volume":"46","author":"M. Thorup","year":"1999","unstructured":"Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46, 362\u2013394 (1999)","journal-title":"J. ACM"},{"key":"169_CR18","doi-asserted-by":"crossref","unstructured":"Vegter, G., Yap, C.: Computational complexity of combinatorial surfaces. In: Proceedings of the 6th ACM Symposium on Computational Geometry, pp. 102\u2013111 (1990)","DOI":"10.1145\/98524.98546"},{"issue":"2","key":"169_CR19","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/990002.990007","volume":"23","author":"Z. Wood","year":"2004","unstructured":"Wood, Z., Hoppe, H., Desbrun, M., Schr\u00f6der, P.: Removing excess topology from isosurfaces. ACM Trans. Graph. 23(2), 190\u2013208 (2004)","journal-title":"ACM Trans. Graph."}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-007-0169-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-007-0169-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-007-0169-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:16Z","timestamp":1559055556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-007-0169-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,10]]},"references-count":19,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2007,11,16]]}},"alternative-id":["169"],"URL":"https:\/\/doi.org\/10.1007\/s00371-007-0169-9","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,10]]}}}