{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:30:47Z","timestamp":1740807047488,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_10","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"109-120","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Shortest Homotopic Paths in Weighted Regions"],"prefix":"10.1007","author":[{"given":"Siu-Wing","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiongxin","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yajun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L. Aleksandrov","year":"2005","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM\u00a052, 25\u201353 (2005)","journal-title":"J. ACM"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/S0196-6774(03)00090-7","volume":"49","author":"S. Bespamyatnikh","year":"2003","unstructured":"Bespamyatnikh, S.: Computing homotopic shortest paths in the plane. J. Alg.\u00a049, 284\u2013303 (2003)","journal-title":"J. Alg."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00454-003-2949-y","volume":"31","author":"S. Cabello","year":"2004","unstructured":"Cabello, S., Liu, Y., Mantler, A., Snoeyink, J.: Testing Homotopy for Paths in the Plane. Discr. Comput. Geom.\u00a031, 61\u201381 (2004)","journal-title":"Discr. Comput. Geom."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.comgeo.2006.03.003","volume":"35","author":"A. Efrat","year":"2006","unstructured":"Efrat, A., Kobourov, S.G., Lubiw, A.: Computing homotopic shortest paths efficiently. Comput. Geom. Theory and Appl.\u00a035, 162\u2013172 (2006)","journal-title":"Comput. Geom. Theory and Appl."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th Annu. Sympos. Found. Comput. Sci., pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"10_CR6","first-page":"61","volume":"24","author":"K.D. Forbus","year":"2004","unstructured":"Forbus, K.D., Uhser, J., Chapman, V.: Qualitative spatial reasoning about sketch maps. AI Magazine\u00a024, 61\u201372 (2004)","journal-title":"AI Magazine"},{"key":"10_CR7","doi-asserted-by":"publisher","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\u00a034, 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Gao, S., Jerrum, M., Kaufmann, M., Kehlhorn, K., R\u00fclling, W., Storb, C.: On continuous homotopic one layer routing. In: Proc. 4th Annu. Sympos. Comput. Geom., pp. 392\u2013402 (1998)","DOI":"10.1145\/73393.73433"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J. Hershberger","year":"1994","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. Theory and Appl.\u00a04, 63\u201398 (1994)","journal-title":"Comput. Geom. Theory and Appl."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0095-8956(92)90031-R","volume":"55","author":"M. Kaufmann","year":"1992","unstructured":"Kaufmann, M., Mehlhorn, K.: On local routing of two-terminal nets. J. Comb. Theory, Ser. B\u00a055, 33\u201372 (1992)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E., Maley, F.M.: Algorithms for routing and testing routability of planar VLSI layouts. In: Proc. 17th Annu. Sympos. Theory of Comput., pp. 69\u201378 (1985)","DOI":"10.1145\/22145.22153"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J. Mitchell","year":"1991","unstructured":"Mitchell, J., Papadimitriou, C.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. J. ACM\u00a038, 18\u201373 (1991)","journal-title":"J. ACM"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.07.004","volume":"58","author":"Z. Sun","year":"2006","unstructured":"Sun, Z., Reif, J.: On finding approximate optimal paths in weighted regions. J. Alg.\u00a058, 1\u201332 (2006)","journal-title":"J. Alg."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T12:13:18Z","timestamp":1740744798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}