{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:00Z","timestamp":1759063740178},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09955-2_33","type":"book-chapter","created":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T01:59:07Z","timestamp":1409709547000},"page":"396-409","source":"Crossref","is-referenced-by-count":6,"title":["On Finding\u00a0Spherical\u00a0Geodesic\u00a0Paths and\u00a0Circles in\u00a0\u21243"],"prefix":"10.1007","author":[{"given":"Ranita","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha","family":"Bhowmick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TPAMI.2008.213","volume":"31","author":"M. Balasubramanian","year":"2009","unstructured":"Balasubramanian, M., Polimeni, J.R., Schwartz, E.L.: Exact geodesics and shortest paths on polyhedral surfaces. IEEE TPAMI\u00a031, 1006\u20131016 (2009)","journal-title":"IEEE TPAMI"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.dam.2006.08.004","volume":"155","author":"V. Brimkov","year":"2007","unstructured":"Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity\u2014A review. Discrete Appl. Math.\u00a0155, 468\u2013495 (2007)","journal-title":"Discrete Appl. Math."},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/TPAMI.2002.1017622","volume":"24","author":"T. B\u00fclow","year":"2002","unstructured":"B\u00fclow, T., Klette, R.: Digital curves in 3D space and a linear-time length estimation algorithm. IEEE TPAMI\u00a024, 962\u2013970 (2002)","journal-title":"IEEE TPAMI"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Han, Y.: Shortest paths on a polyhedron. In: Proc. SoCG, pp. 360\u2013369 (1990)","DOI":"10.1145\/98524.98601"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.patrec.2003.12.002","volume":"25","author":"D. Coeurjolly","year":"2004","unstructured":"Coeurjolly, D., Miguet, S., Tougne, L.: 2D and 3D visibility in discrete geometry: An application to discrete geodesic paths. PRL\u00a025, 561\u2013570 (2004)","journal-title":"PRL"},{"key":"33_CR6","first-page":"453","volume":"57","author":"D. Cohen-Or","year":"1995","unstructured":"Cohen-Or, D., Kaufman, A.: Fundamentals of surface voxelization. GMIP\u00a057, 453\u2013461 (1995)","journal-title":"GMIP"},{"key":"33_CR7","unstructured":"Coxeter, H.S.M.: Regular Polytopes. Dover Pub. (1973)"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Kimmel, R., Sethian, J.A.: Computing geodesic paths on manifolds. Proc. Natl. Acad. Sci. USA, 8431\u20138435 (1998)","DOI":"10.1073\/pnas.95.15.8431"},{"key":"33_CR9","volume-title":"Digital Geometry: Geometric Methods for Digital Picture Analysis","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1016\/j.imavis.2006.06.021","volume":"25","author":"F. Li","year":"2007","unstructured":"Li, F., Klette, R.: Analysis of the rubberband algorithm. Image Vision Comput.\u00a025, 1588\u20131598 (2007)","journal-title":"Image Vision Comput."},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.cag.2005.08.003","volume":"29","author":"D. Mart\u00ednez","year":"2005","unstructured":"Mart\u00ednez, D., Velho, L., Carvalho, P.C.: Computing geodesics on triangular meshes. Computers & Graphics\u00a029, 667\u2013675 (2005)","journal-title":"Computers & Graphics"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J.S.B. Mitchell","year":"1987","unstructured":"Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput.\u00a016, 647\u2013668 (1987)","journal-title":"SIAM J. Comput."},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Polthier, K., Schmies, M.: Straightest geodesics on polyhedral surfaces. In: ACM SIGGRAPH 2006 Courses, pp. 30\u201338 (2006)","DOI":"10.1145\/1185657.1185664"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1145\/1073204.1073228","volume":"24","author":"V. Surazhsky","year":"2005","unstructured":"Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S.J., Hoppe, H.: Fast exact and approximate geodesics on meshes. ACM TOG\u00a024, 553\u2013560 (2005)","journal-title":"ACM TOG"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"2662","DOI":"10.1016\/j.dam.2013.06.001","volume":"161","author":"J.L. Toutant","year":"2013","unstructured":"Toutant, J.L., Andres, E., Roussillon, T.: Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties. Discrete Appl. Math.\u00a0161, 2662\u20132677 (2013)","journal-title":"Discrete Appl. Math."},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Xin, S.Q., Wang, G.J.: Improving Chen and Han\u2019s algorithm on the discrete geodesic problem. ACM TOG 28, Art. 104 (2009)","DOI":"10.1145\/1559755.1559761"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Xin, S.Q., Ying, X., He, Y.: Constant-time all-pairs geodesic distance query on triangle meshes. In: Proc. I3D 2012, pp. 31\u201338 (2012)","DOI":"10.1145\/2159616.2159622"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Ying, X., Wang, X., He, Y.: Saddle vertex graph (SVG): A novel solution to the discrete geodesic problem. ACM TOG 32, Art. 170 (2013)","DOI":"10.1145\/2508363.2508379"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Ying, X., Xin, S.Q., He, Y.: Parallel Chen-Han (PCH) algorithm for discrete geodesics. ACM TOG 33, Art. 9 (2014)","DOI":"10.1145\/2534161"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09955-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:13:29Z","timestamp":1558970009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09955-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09955-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}