{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T17:10:24Z","timestamp":1739466624911,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_12","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"97-111","source":"Crossref","is-referenced-by-count":1,"title":["Fr\u00e9chet Distance Problems in Weighted Regions"],"prefix":"10.1007","author":[{"given":"Yam Ki","family":"Cheung","sequence":"first","affiliation":[]},{"given":"Ovidiu","family":"Daescu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11821069_9","volume-title":"Mathematical Foundations of Computer Science 2006","author":"L. Aleksandrov","year":"2006","unstructured":"Aleksandrov, L., Djidjev, H.N., Guo, H., Maheshwari, A., Nussbaum, D., Sack, J.: Approximate shortest path queries on weighted polyhedral surfaces. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 98\u2013109. Springer, Heidelberg (2006)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A.A., Sack, J.R.: Approximation algorithms for geometric shortest path problems. In: Proc. 32nd Annual ACM Symposium on Theory of Computing, pp. 286\u2013295 (2000)","DOI":"10.1145\/335305.335339"},{"issue":"1","key":"12_CR3","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.: Determining approximate shortest paths on weighted polyhedral surfaces. Journal of the ACM\u00a052(1), 25\u201353 (2005)","journal-title":"Journal of the ACM"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computation the Fr\u00e9chet distance between two polygonal curves. International Journal of Computational Geometry and Applications\u00a05, 75\u201391 (1995)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"12_CR5","unstructured":"Amato, N.M., Goodrich, M.T., Ramos, E.A.: Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In: Proc. 11th Annual CAM-SIAM Symposium on Discrete Algorithms, pp. 705\u2013706 (2000)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wenk, C.: Computing the Fr\u00e9chet distance between simple polygons in polynomial time. In: Proc. 22nd Symposium on Computational Geometry, pp. 80\u201387 (2006)","DOI":"10.1145\/1137856.1137870"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact partial curve matching under the Fr\u00e9chet distance. In: Proc. ACM-SIAM Symposium on Discrete Algorithms (to appear, 2009)","DOI":"10.1137\/1.9781611973068.71"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Chambers, E.W., De Verdi\u00e8re,C. \u00c9., Erickson, J., Lazard, S., Lazarus, F., Thite, S.: Walking your dog in the woods in polynomial time. In: Proc. 24th Annual ACM Symposium on Computational Geometry, pp. 101\u2013109 (2008)","DOI":"10.1145\/1377676.1377694"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009885517653","volume":"5","author":"D.Z. Chen","year":"2001","unstructured":"Chen, D.Z., Daescu, O., Hu, X., Wu, X., Xu, J.: Determining an optimal penetration among weighted regions in two and three dimensions. J. combinat. Optim.\u00a05(1), 59\u201379 (2001)","journal-title":"J. combinat. Optim."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Na, H.S., Vigneron, A., Wang, Y.: Approximate shortest paths in anisotropic regions. In: Proc. 18th annual ACM-SIAM symposium on Discrete algorithms, pp. 766\u2013774 (2007)","DOI":"10.1145\/1247069.1247082"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Na, H.S., Vigneron, A., Wang, Y.: Querying approximate shortest paths in anisotropic regions. In: Proc. 23rd annual symposium on Computational geometry, pp. 84\u201391 (2005)","DOI":"10.1145\/1247069.1247082"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Proc. 19th Annual ACM Symposium on Theory of Computing, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"G.E. Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 134\u2013183. Springer, Heidelberg (1975)"},{"key":"12_CR14","unstructured":"Cook IV, A.F., Wenk, C.: Geodesic Fr\u00e9chet distance inside a simple polygon. In: Proc. 25th International Symposium on Theoretical Aspects of Computer Science, pp. 193\u2013204 (2008)"},{"key":"12_CR15","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Technical Report CD-TR 94\/64, Information Systems Department, Technical University of Vienna (1994)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03018603","volume":"22","author":"M. Fr\u00e9chet","year":"1906","unstructured":"Fr\u00e9chet, M.: Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Mathematico di Palermo\u00a022, 1\u201374 (1906)","journal-title":"Rendiconti del Circolo Mathematico di Palermo"},{"key":"12_CR17","unstructured":"Maheshwari, A., Yi, J.: On computing Fr\u00e9chet distance of two paths on a convex polyhedron. In: Proc. 21st European Workshop on computational Geometry, pp. 41\u201344 (2005)"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planer subdivision. Journal of the ACM\u00a038(1), 18\u201373 (1991)","journal-title":"Journal of the ACM"},{"key":"12_CR19","unstructured":"Rote, G.: Computing the Fr\u00e9chet distance between piecewise smooth curves. Technical Report, ECGTR-241108-01 (2005)"},{"issue":"1","key":"12_CR20","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.H.: On finding approximate optimal path in weighted regions. Journal of Algorithms\u00a058(1), 1\u201332 (2006)","journal-title":"Journal of Algorithms"},{"key":"12_CR21","unstructured":"Beer-Lambert law. Wikipedia, http:\/\/en.wikipedia.org\/wiki\/BeerLambert_law"}],"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-10631-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T16:36:54Z","timestamp":1739464614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}