乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T05:56:37Z","timestamp":1715234197026},"reference-count":27,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1016\/j.comgeo.2014.02.002","type":"journal-article","created":{"date-parts":[[2014,2,19]],"date-time":"2014-02-19T19:46:59Z","timestamp":1392839219000},"page":"728-739","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Computing homotopic line simplification"],"prefix":"10.1016","volume":"47","author":[{"given":"M.A.","family":"Abam","sequence":"first","affiliation":[]},{"given":"S.","family":"Daneshpajouh","sequence":"additional","affiliation":[]},{"given":"L.","family":"Deleuran","sequence":"additional","affiliation":[]},{"given":"S.","family":"Ehsani","sequence":"additional","affiliation":[]},{"given":"M.","family":"Ghodsi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.comgeo.2014.02.002_br0010","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s00454-008-9132-4","article-title":"Streaming algorithms for line simplification","volume":"43","author":"Abam","year":"2010","journal-title":"Discrete Comput. Geom."},{"issue":"3\u20134","key":"10.1016\/j.comgeo.2014.02.002_br0020","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00453-005-1165-y","article-title":"Near-linear time approximation algorithms for curve simplification","volume":"42","author":"Agarwal","year":"2005","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2014.02.002_br0030","series-title":"Proc. Annual Symposium on Computational Geometry","first-page":"27","article-title":"Computing the visibility graph of points within a polygon","author":"Ben-Moshe","year":"2004"},{"key":"10.1016\/j.comgeo.2014.02.002_br0040","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"2008"},{"key":"10.1016\/j.comgeo.2014.02.002_br0050","first-page":"79","article-title":"A new approach to subdivision simplification","volume":"4","author":"de Berg","year":"1995","journal-title":"Auto-Carto 12"},{"issue":"4","key":"10.1016\/j.comgeo.2014.02.002_br0060","first-page":"243","article-title":"Topologically correct subdivision simplification using the bandwidth criterion","volume":"25","author":"de Berg","year":"1998","journal-title":"Cartogr. Geogr. Inf. Sci."},{"issue":"3","key":"10.1016\/j.comgeo.2014.02.002_br0070","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1142\/S0218195902000839","article-title":"An optimal morphing between polylines","volume":"12","author":"Bespamyatnikh","year":"2002","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"10.1016\/j.comgeo.2014.02.002_br0080","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/S0196-6774(03)00090-7","article-title":"Computing homotopic shortest paths in the plane","volume":"49","author":"Bespamyatnikh","year":"2003","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/j.comgeo.2014.02.002_br0090","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.comgeo.2008.03.002","article-title":"Optimal simplification of polygonal chains for subpixel-accurate rendering","volume":"42","author":"Buzer","year":"2009","journal-title":"Comput. Geom."},{"issue":"1","key":"10.1016\/j.comgeo.2014.02.002_br0100","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00454-003-2949-y","article-title":"Testing homotopy for paths in the plane","volume":"31","author":"Cabello","year":"2004","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.comgeo.2014.02.002_br0110","series-title":"Proc. International Symposium on Algorithms and Computation, 650","first-page":"378","article-title":"Approximation of polygonal curves with minimum number of line segments","author":"Chan","year":"1992"},{"issue":"1\u20134","key":"10.1016\/j.comgeo.2014.02.002_br0120","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01762115","article-title":"An algorithm for segment-dragging and its implementation","volume":"3","author":"Chazelle","year":"1988","journal-title":"Algorithmica"},{"issue":"5","key":"10.1016\/j.comgeo.2014.02.002_br0130","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.gmod.2012.04.006","article-title":"Computing polygonal path simplification under area measures","volume":"74","author":"Daneshpajouh","year":"2012","journal-title":"Graph. Models"},{"issue":"3","key":"10.1016\/j.comgeo.2014.02.002_br0140","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1006\/cgip.1994.1021","article-title":"On approximating polygonal curves in two and three dimensions","volume":"56","author":"Eu","year":"1994","journal-title":"CVGIP, Graph. Models Image Process."},{"issue":"2","key":"10.1016\/j.comgeo.2014.02.002_br0150","first-page":"112","article-title":"Algorithms for the reduction of the number of points required to represent a digitized line or its caricature","volume":"10","author":"Douglas","year":"1973","journal-title":"Cartogr. Int. J. Geogr. Inf. Geovis."},{"issue":"1","key":"10.1016\/j.comgeo.2014.02.002_br0160","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s00454-012-9402-z","article-title":"Approximating the Fr\u00e9chet distance for realistic curves in near linear time","volume":"48","author":"Driemel","year":"2012","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/j.comgeo.2014.02.002_br0170","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.comgeo.2014.02.002_br0180","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s00454-002-2886-1","article-title":"New similarity measures between polylines with applications to morphing and polygon sweeping","volume":"28","author":"Efrat","year":"2002","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.comgeo.2014.02.002_br0190","series-title":"Proc. Annual Symposium on Computational Geometry","first-page":"40","article-title":"Simplifying a polygonal subdivision while keeping it simple","author":"Estkowski","year":"2001"},{"issue":"4","key":"10.1016\/j.comgeo.2014.02.002_br0200","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BF02570717","article-title":"Efficient piecewise-linear function approximation using the uniform metric","volume":"14","author":"Goodrich","year":"1995","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"10.1016\/j.comgeo.2014.02.002_br0210","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1142\/S0218195993000257","article-title":"Approximating polygons and subdivisions with minimum-link paths","volume":"3","author":"Guibas","year":"1993","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10.1016\/j.comgeo.2014.02.002_br0220","series-title":"Proc. Annual Symposium on Computational Geometry","first-page":"383","article-title":"An O(nlogn) implementation of the Douglas\u2013Peucker algorithm for line simplification","author":"Hershberger","year":"1994"},{"issue":"3","key":"10.1016\/j.comgeo.2014.02.002_br0230","first-page":"159","article-title":"An optimal algorithm for approximating a piecewise linear function","volume":"9","author":"Imai","year":"1986","journal-title":"J. Inf. Process."},{"key":"10.1016\/j.comgeo.2014.02.002_br0240","series-title":"Computational Morphology","first-page":"71","article-title":"Polygonal approximations of a curve \u2013 formulations and algorithms","author":"Imai","year":"1988"},{"issue":"3","key":"10.1016\/j.comgeo.2014.02.002_br0250","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problem","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.comgeo.2014.02.002_br0260","series-title":"Computational Morphology","first-page":"87","article-title":"On polygonal chain approximation","author":"Melkman","year":"1988"},{"issue":"4","key":"10.1016\/j.comgeo.2014.02.002_br0270","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1006\/cgip.1994.1027","article-title":"Counting and reporting red\/blue segment intersections","volume":"56","author":"Palazzi","year":"1994","journal-title":"CVGIP, Graph. Models Image Process."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772114000352?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772114000352?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T14:28:37Z","timestamp":1538836117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772114000352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["S0925772114000352"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2014.02.002","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing homotopic line simplification","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2014.02.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}