乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T12:38:19Z","timestamp":1721651899080},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,18]],"date-time":"2012-02-18T00:00:00Z","timestamp":1329523200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00454-012-9402-z","type":"journal-article","created":{"date-parts":[[2012,2,17]],"date-time":"2012-02-17T15:59:06Z","timestamp":1329494346000},"page":"94-127","source":"Crossref","is-referenced-by-count":63,"title":["Approximating the Fr\u00e9chet Distance for Realistic Curves in Near Linear Time"],"prefix":"10.1007","volume":"48","author":[{"given":"Anne","family":"Driemel","sequence":"first","affiliation":[]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[]},{"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,18]]},"reference":[{"key":"9402_CR1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00453-005-1165-y","volume":"42","author":"P.K. Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Mustafa, N., Wang, Y.: Near-linear time approximation algorithms for curve simplification in two and three dimensions. Algorithmica 42, 203\u2013219 (2005)","journal-title":"Algorithmica"},{"key":"9402_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-03456-5_16","volume-title":"Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday","author":"H. Alt","year":"2009","unstructured":"Alt, H.: The computational geometry of comparing shapes. In: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, pp. 235\u2013248. Springer, Berlin (2009)"},{"key":"9402_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"9402_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00453-003-1042-5","volume":"38","author":"H. Alt","year":"2004","unstructured":"Alt, H., Knauer, C., Wenk, C.: Comparison of distance measures for planar curves. Algorithmica 38(1), 45\u201358 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"9402_CR5","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B. Aronov","year":"2008","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM J. Comput. 38(3), 899\u2013921 (2008)","journal-title":"SIAM J. Comput."},{"key":"9402_CR6","first-page":"52","volume-title":"Proc. 14th Annu. European Symp. Algorithms","author":"B. Aronov","year":"2006","unstructured":"Aronov, B., Har-Peled, S., Knauer, C., Wang, Y., Wenk, C.: Fr\u00e9chet distance for curves, revisited. In: Proc. 14th Annu. European Symp. Algorithms, pp. 52\u201363 (2006)"},{"issue":"1","key":"9402_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.comgeo.2010.06.002","volume":"44","author":"P. Bose","year":"2011","unstructured":"Bose, P., Cheong, O., Dujmovi\u0107, V.: A note on the perimeter of fat objects. Comput. Geom. Theory Appl. 44(1), 1\u20138 (2011)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9402_CR8","first-page":"853","volume-title":"Proc. 31st VLDB Conference","author":"S. Brakatsoulas","year":"2005","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proc. 31st VLDB Conference, pp. 853\u2013864 (2005)"},{"key":"9402_CR9","first-page":"170","volume-title":"Proc. 23rd Euro. Workshop on Comput. Geom.","author":"K. Buchin","year":"2007","unstructured":"Buchin, K., Buchin, M., Knauer, C., Rote, G., Wenk, C.: How difficult is it to walk the dog. In: Proc. 23rd Euro. Workshop on Comput. Geom., pp. 170\u2013173 (2007)"},{"key":"9402_CR10","first-page":"288","volume-title":"Proc. 16th ACM SIGSPATIAL Int. Conf. Adv. GIS","author":"K. Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J.: Detecting single file movement. In: Proc. 16th ACM SIGSPATIAL Int. Conf. Adv. GIS, pp. 288\u2013297 (2008)"},{"key":"9402_CR11","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1007\/978-3-540-92182-0_57","volume-title":"Proc. 19th Annu. Internat. Symp. Algorithms Comput.","author":"K. Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J., Maarten, L., Luo, J.: Detecting commuting patterns by clustering subtrajectories. In: Proc. 19th Annu. Internat. Symp. Algorithms Comput., pp. 644\u2013655 (2008)"},{"key":"9402_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. Assoc. Comput. Mach. 42, 67\u201390 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9402_CR13","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s004530010047","volume":"28","author":"M. Berg de","year":"2000","unstructured":"de Berg, M.: Linear size binary space partitions for uncluttered scenes. Algorithmica 28, 353\u2013366 (2000)","journal-title":"Algorithmica"},{"issue":"1","key":"9402_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00454-007-9029-7","volume":"40","author":"M. Berg de","year":"2008","unstructured":"de Berg, M.: Improved bounds on the union complexity of fat objects. Discrete Comput. Geom. 40(1), 127\u2013140 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"9402_CR15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00453-002-0961-x","volume":"34","author":"M. Berg de","year":"2002","unstructured":"de Berg, M., Katz, M.J., van\u00a0der Stappen, A.F., Vleugels, J.: Realistic input models for geometric algorithms. Algorithmica 34, 81\u201397 (2002)","journal-title":"Algorithmica"},{"key":"9402_CR16","first-page":"365","volume-title":"Proc. 26th Annu. ACM Symp. Comput. Geom.","author":"A. Driemel","year":"2010","unstructured":"Driemel, A., Har-Peled, S., Wenk, C.: Approximating the Fr\u00e9chet distance for realistic curves in near linear time. In: Proc. 26th Annu. ACM Symp. Comput. Geom., pp. 365\u2013374 (2010). arXiv:1003.0460"},{"issue":"4","key":"9402_CR17","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1137\/S0097539702407515","volume":"34","author":"A. Efrat","year":"2005","unstructured":"Efrat, A.: The complexity of the union of (\u03b1,\u03b2)-covered objects. SIAM J. Comput. 34(4), 775\u2013787 (2005)","journal-title":"SIAM J. Comput."},{"key":"9402_CR18","first-page":"85","volume-title":"Proc. 7th Canad. Conf. Comput. Geom.","author":"J. Erickson","year":"1995","unstructured":"Erickson, J.: On the relative complexities of some geometric problems. In: Proc. 7th Canad. Conf. Comput. Geom., pp. 85\u201390 (1995)"},{"key":"9402_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-48247-5_1","volume-title":"Proc. of the Third Euro. Conf. Princip. Data Mining and Know. Disc.","author":"E.J. Keogh","year":"1999","unstructured":"Keogh, E.J., Pazzani, M.J.: Scaling up dynamic time warping to massive dataset. In: Proc. of the Third Euro. Conf. Princip. Data Mining and Know. Disc., pp. 1\u201311 (1999)"},{"key":"9402_CR20","first-page":"581","volume-title":"Proc. ACM Symp. Appl. Comput.","author":"M.S. Kim","year":"2005","unstructured":"Kim, M.S., Kim, S.W., Shin, M.: Optimization of subsequence matching under time warping in time-series databases. In: Proc. ACM Symp. Appl. Comput., pp. 581\u2013586 (2005)"},{"issue":"5","key":"9402_CR21","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1142\/S0218001498000348","volume":"12","author":"S. Kwong","year":"1998","unstructured":"Kwong, S., He, Q.H., Man, K.F., Tang, K.S., Chau, C.W.: Parallel genetic-based hybrid pattern matching algorithm for isolated word recognition. Int. J. Pattern Recognit. Artif. Intell. 12(5), 573\u2013594 (1998)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"9402_CR22","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/ICCV.1999.791205","volume-title":"Proc. 7th Int. Conf. Comp. Vision","author":"M.E. Munich","year":"1999","unstructured":"Munich, M.E., Perona, P.: Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification. In: Proc. 7th Int. Conf. Comp. Vision, pp. 108\u2013115 (1999)"},{"key":"9402_CR23","first-page":"461","volume-title":"Proc. 9th Int. Conf. Doc. Anal. Recogn.","author":"E. Sriraghavendra","year":"2007","unstructured":"Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fr\u00e9chet distance based approach for searching online handwritten documents. In: Proc. 9th Int. Conf. Doc. Anal. Recogn., pp. 461\u2013465 (2007)"},{"key":"9402_CR24","first-page":"879","volume-title":"Proc. 18th Int. Conf. Sci. Statist. Database Managm.","author":"C. Wenk","year":"2006","unstructured":"Wenk, C., Salas, R., Pfoser, D.: Addressing the need for map-matching speed: localizing global curve-matching algorithms. In: Proc. 18th Int. Conf. Sci. Statist. Database Managm., pp. 879\u2013888 (2006)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9402-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9402-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9402-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T20:29:22Z","timestamp":1686774562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9402-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,18]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9402"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9402-z","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,18]]}}}