{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:47Z","timestamp":1750307807069,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,9]]},"DOI":"10.1145\/1377676.1377694","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"101-109","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Walking your dog in the woods in polynomial time"],"prefix":"10.1145","author":[{"given":"Erin Wolf","family":"Chambers","sequence":"first","affiliation":[{"name":"UIUC, Urbana, IL, USA"}]},{"given":"\u00c9ric","family":"Colin de Verdi\u00e8re","sequence":"additional","affiliation":[{"name":"Ecole Normale Sup\u00e9rieure, Paris, France"}]},{"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[{"name":"UIUC, Urbana, IL, USA"}]},{"given":"Sylvain","family":"Lazard","sequence":"additional","affiliation":[{"name":"INRIA Lorraine, LORIA, Nancy, France"}]},{"given":"Francis","family":"Lazarus","sequence":"additional","affiliation":[{"name":"Institut National Polytechnique de Grenoble, Grenoble, France"}]},{"given":"Shripad","family":"Thite","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Pasadena, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"21st European Workshop on Computational Geometry, 45--48","author":"Alt H.","year":"2005","unstructured":"H. Alt and M. Buchin . Semi-computability of the Fr\u00e9chet distance between surfaces. phProc . 21st European Workshop on Computational Geometry, 45--48 , 2005 . H. Alt and M. Buchin. Semi-computability of the Fr\u00e9chet distance between surfaces. phProc. 21st European Workshop on Computational Geometry, 45--48, 2005."},{"key":"e_1_3_2_1_2_1","volume-title":"Computing the Fr\u00e9chet distance between two polygonal curves. phIJCGA 5(1-2):75--91","author":"Alt H.","year":"1995","unstructured":"H. Alt and M. Godau . Computing the Fr\u00e9chet distance between two polygonal curves. phIJCGA 5(1-2):75--91 , 1995 . H. Alt and M. Godau. Computing the Fr\u00e9chet distance between two polygonal curves. phIJCGA 5(1-2):75--91, 1995."},{"key":"e_1_3_2_1_3_1","volume-title":"Computing homotopic shortest paths in the plane. phProc. 14th Annu. ACM-SIAM Sympos. Discrete Algorithms, 609--617","author":"Bespamyatnikh S.","year":"2003","unstructured":"S. Bespamyatnikh . Computing homotopic shortest paths in the plane. phProc. 14th Annu. ACM-SIAM Sympos. Discrete Algorithms, 609--617 , 2003 . S. Bespamyatnikh. Computing homotopic shortest paths in the plane. phProc. 14th Annu. ACM-SIAM Sympos. Discrete Algorithms, 609--617, 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24698-5_37"},{"issue":"1","key":"e_1_3_2_1_5_1","first-page":"61","article-title":"Testing homotopy for paths in the plane. phDiscrete Comput","volume":"31","author":"Cabello S.","year":"2004","unstructured":"S. Cabello , Y. Liu , A. Mantler , and J. Snoeyink . Testing homotopy for paths in the plane. phDiscrete Comput . Geom. 31 ( 1 ): 61 -- 81 , 2004 . S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink. Testing homotopy for paths in the plane. phDiscrete Comput. Geom. 31(1):61--81, 2004.","journal-title":"Geom."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.58"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7537"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_10_1","first-page":"535","article-title":"New similarity measures between polylines with applications to morphing and polygon sweeping. phDiscrete Comput","volume":"28","author":"Efrat A.","year":"2002","unstructured":"A. Efrat , L. J. Guibas , S. Har-Peled , J. S. B. Mitchell , and T. M. Murali . New similarity measures between polylines with applications to morphing and polygon sweeping. phDiscrete Comput . Geom. 28 : 535 -- 569 , 2002 . A. Efrat, L. J. Guibas, S. Har-Peled, J. S. B. Mitchell, and T. M. Murali. New similarity measures between polylines with applications to morphing and polygon sweeping. phDiscrete Comput. Geom. 28:535--569, 2002.","journal-title":"Geom."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2006.03.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/281508.281528"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)90010-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795289604"},{"key":"e_1_3_2_1_15_1","volume-title":"Euclidean shortest paths in the presence of rectilinear barriers. phNetworks 14:393--410","author":"Lee D. T.","year":"1984","unstructured":"D. T. Lee and F. P. Preparata . Euclidean shortest paths in the presence of rectilinear barriers. phNetworks 14:393--410 , 1984 . D. T. Lee and F. P. Preparata. Euclidean shortest paths in the presence of rectilinear barriers. phNetworks 14:393--410, 1984."},{"key":"e_1_3_2_1_16_1","volume-title":"21st European Workshop on Computational Geometry, 41--44","author":"Maheshwari A.","year":"2005","unstructured":"A. Maheshwari and J. Yi . On computing Fr\u00e9chet distance of two paths on a convex polyhedron. phProc . 21st European Workshop on Computational Geometry, 41--44 , 2005 . A. Maheshwari and J. Yi. On computing Fr\u00e9chet distance of two paths on a convex polyhedron. phProc. 21st European Workshop on Computational Geometry, 41--44, 2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2157.322410"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.03.006"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009330"}],"event":{"name":"SoCG08: 24th Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"College Park MD USA","acronym":"SoCG08"},"container-title":["Proceedings of the twenty-fourth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377694","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1377676.1377694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:39Z","timestamp":1750254999000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":18,"alternative-id":["10.1145\/1377676.1377694","10.1145\/1377676"],"URL":"https:\/\/doi.org\/10.1145\/1377676.1377694","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}