{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T15:58:16Z","timestamp":1721836696689},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,8,7]],"date-time":"2008-08-07T00:00:00Z","timestamp":1218067200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10044-008-0133-y","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T10:33:44Z","timestamp":1218018824000},"page":"367-375","source":"Crossref","is-referenced-by-count":12,"title":["Speeding up simplification of polygonal curves using nested approximations"],"prefix":"10.1007","volume":"12","author":[{"given":"P. F.","family":"Marteau","sequence":"first","affiliation":[]},{"given":"G.","family":"M\u00e9nier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,7]]},"reference":[{"key":"133_CR1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1006\/cviu.1998.0707","volume":"71","author":"J Le Buhan","year":"1998","unstructured":"Le Buhan J, Ebrahimi T, Kunt M (1998) Progressive content-based shape compression for retrieval of binary images. Computer Vision and Image Understanding 71:198\u2013212","journal-title":"Computer Vision and Image Understanding"},{"key":"133_CR2","doi-asserted-by":"crossref","unstructured":"Buttenfield BP (2002) Transmitting vector geospatial data across the internet. In: Proc GIScience, Lecture Notes in Computer Science, volume 2478, pp 51\u201364","DOI":"10.1007\/3-540-45799-2_4"},{"key":"133_CR3","unstructured":"National Geophysical Data Center (2008) Noaa satellite and information services"},{"key":"133_CR4","doi-asserted-by":"crossref","unstructured":"Chen DZ, Daescu O (1998) Space-efficient algorithms for approximating polygonal curves in two-dimensional space. In: Int Conf on Computing and Combinatorics, Lecture Notes in Computer Science, volume 1449, pp 4554","DOI":"10.1007\/3-540-68535-9_8"},{"key":"133_CR5","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas DH, Peucker TK (1973) Algorithm for the reduction of the number of points required to represent a line or its caricature. The Canadian Cartographer 10:112\u2013122","journal-title":"The Canadian Cartographer"},{"key":"133_CR6","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1016\/S0167-8655(02)00129-0","volume":"23","author":"J-H Horng","year":"2002","unstructured":"Horng J-H (2002) Improving fitting quality of polygonal approximation by using the dynamic programming technique. Pattern Recognition Letters 23:1657\u20131673","journal-title":"Pattern Recognition Letters"},{"key":"133_CR7","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/S1571-0653(04)00500-1","volume":"12","author":"J-L Remy","year":"2003","unstructured":"Remy J-L, Debled-Rennesson I, Rouyer J (2003) Segmentation of discrete curves into fuzzy segments. Electronic Notes in Discrete Mathematics 12:372\u2013383","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"133_CR8","doi-asserted-by":"crossref","unstructured":"Imai H, Iri M (1988) Polygonal approximations of a curve - formulations and algorithms. Computational Morphology, pp 71\u201386","DOI":"10.1016\/B978-0-444-70467-2.50011-4"},{"key":"133_CR9","doi-asserted-by":"crossref","unstructured":"Katsaggelos AK, Kondi LP, Meier FW, Osterman J, Schuster GM (1998) Mpeg-4 and rate-distortion-based shape-coding techniques. In: Proceedings of the IEEE, volume 86, pp 1126\u20131154","DOI":"10.1109\/5.687833"},{"key":"133_CR10","doi-asserted-by":"crossref","first-page":"2243","DOI":"10.1016\/S0167-8655(03)00051-5","volume":"24","author":"A Kolesnikov","year":"2003","unstructured":"Kolesnikov A, Fr\u00e4nti P (2003) Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters 24:2243\u20132254","journal-title":"Pattern Recognition Letters"},{"key":"133_CR11","doi-asserted-by":"crossref","unstructured":"Kolesnikov A, Fr\u00e4nti P, Wu X (2004) Multiresolution polygonal approximation of digital curves. In: Proceedings of the 17th International Conference on Pattern Recognition (ICPR\u201904), pp 855\u2013858","DOI":"10.1109\/ICPR.2004.1334393"},{"key":"133_CR12","doi-asserted-by":"crossref","unstructured":"Marteau PF, M\u00e9nier G (2006) Adaptive multiresolution and dedicated elastic matching in linear time complexity for time series data mining. In: Sixth International Conference on Intelligent Systems Design and Applications, pp 700\u2013706","DOI":"10.1109\/ISDA.2006.84"},{"key":"133_CR13","doi-asserted-by":"crossref","unstructured":"Marteau PF (2008) Time warp edit distance with stiffness adjustment for time series matching. IEEE Trans. on Pattern Analysis and Machine Intelligence, pp 1\u201315. DOI:10.1109\/TPAMI.2008.76.","DOI":"10.1109\/TPAMI.2008.76"},{"key":"133_CR14","first-page":"87","volume-title":"On polygonal chain approximation. Computational Morphology","author":"A Melkman","year":"1988","unstructured":"Melkman A, O\u2019Rourke J (1988) On polygonal chain approximation. Computational Morphology, Elsevier Science Publishers B.V., North Holland, pp. 87\u201395"},{"key":"133_CR15","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/0167-8655(94)90002-7","volume":"15","author":"JC Perez","year":"1994","unstructured":"Perez JC, Vidal E (1994) Optimum polygonal approximation of digitized curves. Pattern Recognition Letters 15:743\u2013750","journal-title":"Pattern Recognition Letters"},{"key":"133_CR16","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/0167-8655(95)80001-A","volume":"16","author":"A Pikaz","year":"1995","unstructured":"Pikaz A, Dinstein I (1995) An algorithm for polygonal approximation based on iterative point elimination. Pattern Recognition Letters 16:557\u2013563","journal-title":"Pattern Recognition Letters"},{"key":"133_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1142\/S0219467802000482","volume":"2","author":"KB Pratt","year":"2002","unstructured":"Pratt KB, Fink E (2002) Search for patterns in compressed time series. International Journal of Image and Graphics 2:89\u2013106","journal-title":"International Journal of Image and Graphics"},{"key":"133_CR18","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/34.601253","volume":"14","author":"RL Rosin","year":"1997","unstructured":"Rosin RL (1997) Techniques for assessing polygonal approximations of curves. IEEE Trans. Pattern Analysis and Machine Intelligence 14:659\u2013666","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"133_CR19","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/TBME.2003.821012","volume":"51","author":"G Becq","year":"2004","unstructured":"Becq G, Charbonnier S, Biot L (2004) On-line segmentation algorithm for continuously monitored data in intensive care units. IEEE Trans. On Biomedical Engeneering 51:484\u2013492","journal-title":"IEEE Trans. On Biomedical Engeneering"},{"key":"133_CR20","first-page":"4349","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoustics Speech Signal Process ASSP 26:4349","journal-title":"IEEE Trans Acoustics Speech Signal Process ASSP"},{"key":"133_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0167-8655(00)00088-X","volume":"22","author":"M Salotti","year":"2001","unstructured":"Salotti M (2001) An efficient algorithm for the optimal polygonal approximation of digitized curves. Pattern Recognition Letters 22:215\u2013221","journal-title":"Pattern Recognition Letters"},{"key":"133_CR22","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1179\/caj.1993.30.1.46","volume":"30","author":"M Visvalingam","year":"1993","unstructured":"Visvalingam M, Whyatt J (1993) Line generalization by repeated elimination of points. Cartographic Journal 30:46\u201351","journal-title":"Cartographic Journal"},{"key":"133_CR23","unstructured":"Chin dF WS Chan a (1996) On approximation of polygonal curves with minimum number of line segments or minimum error. Int J Comput Geometry Appl 6:5977"},{"issue":"4","key":"133_CR24","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0031-3203(93)90103-4","volume":"26","author":"J-S Wu","year":"1993","unstructured":"Wu J-S, Leou J-J (1993) New polygonal approximation schemes for object shape representation. Pattern Recognition 26(4):471\u2013484","journal-title":"Pattern Recognition"},{"key":"133_CR25","unstructured":"Zhu Y, Seneviratne LD (1997) Optimal polygonal approximation of digitized curves. In: IEEE Proc-Vis Image Signal Process, volume 144, p 814"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-008-0133-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-008-0133-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-008-0133-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:02:28Z","timestamp":1559116948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-008-0133-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,7]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1007\/s10044-008-0133-y","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,7]]}}}