{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:17:15Z","timestamp":1725549435639},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255130"},{"type":"electronic","value":"9783540319658"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31965-8_34","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:28:13Z","timestamp":1268400493000},"page":"371-382","source":"Crossref","is-referenced-by-count":13,"title":["Optimal Blurred Segments Decomposition in Linear Time"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Debled-Rennesson","sequence":"first","affiliation":[]},{"given":"Fabien","family":"Feschet","sequence":"additional","affiliation":[]},{"given":"Jocelyne","family":"Rouyer-Degli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Debled-Rennesson, I., R\u00e9my, J.-L., Rouyer, J.: Segmentation of discrete curves into fuzzy segments. In: 9th International Workshop on Combinatorial Image Analysis. Electronic Notes in Discrete Mathematics, vol.\u00a012 (2003)","DOI":"10.1016\/S1571-0653(04)00500-1"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Debled-Rennesson, I., R\u00e9my, J.-L., Rouyer, J.: Segmentation of discrete curves into fuzzy segments, extended version. Technical report, INRIA Report RR-4989 (2003), \n                    \n                      http:\/\/www.inria.fr\/rrrt\/rr-4989.html","DOI":"10.1016\/S1571-0653(04)00500-1"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Debled-Rennesson, I., Reveill\u00e8s, J.P.: A linear algorithm for segmentation of digital curves. IJPRAI\u00a09(6) (December 1995)","DOI":"10.1142\/9789812797742_0005"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-49126-0_3","volume-title":"Discrete Geometry for Computer Imagery","author":"F. Feschet","year":"1999","unstructured":"Feschet, F., Tougne, L.: Optimal time computation of the tangent of a discrete curve: application to the curvature. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol.\u00a01568, pp. 31\u201340. Springer, Heidelberg (1999)"},{"issue":"5","key":"34_CR5","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1109\/34.6790","volume":"10","author":"M.E. Houle","year":"1988","unstructured":"Houle, M.E., Toussaint, G.T.: Computing the width of a set. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a010(5), 761\u2013765 (1988)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"14","key":"34_CR6","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1016\/S0167-8655(03)00051-5","volume":"24","author":"A. Kolesnikov","year":"2003","unstructured":"Kolesnikov, A., Fr\u00e4nti, P.: Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letter\u00a024(14), 2243\u20132254 (2003)","journal-title":"Pattern Recognition Letter"},{"issue":"9","key":"34_CR7","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/34.232082","volume":"15","author":"M. Lindenbaum","year":"1993","unstructured":"Lindenbaum, M., Bruckstein, A.: On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a015(9), 949\u2013953 (1993)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A. Melkman","year":"1987","unstructured":"Melkman, A.: On-line Construction of the Convex Hull of a Simple Polygon. Information Processing Letters\u00a025, 11\u201312 (1987)","journal-title":"Information Processing Letters"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/0167-8655(94)90002-7","volume":"15","author":"J. Perez","year":"1994","unstructured":"Perez, J., Vidal, E.: Optimum polygonal approximation of digitized curves. Pattern Recognition Letter\u00a015, 743\u2013750 (1994)","journal-title":"Pattern Recognition Letter"},{"key":"34_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: an Introduction. Springer, Heidelberg (1985)"},{"key":"34_CR11","unstructured":"Reveill\u00e8s, J.P.: G\u00e9om\u00e9trie discr\u00e8te, calculs en nombres entiers et algorithmique. Th\u00e8se d\u2019Etat \u2013 Universit\u00e9 Louis Pasteur (1991)"},{"issue":"1\u20133","key":"34_CR12","first-page":"197","volume":"139","author":"A. Rosenfeld","year":"2004","unstructured":"Rosenfeld, A., Klette, R.: Digital Straightness \u2013 a review. Discrete Applied Math.\u00a0139(1\u20133), 197\u2013230 (2004)","journal-title":"Discrete Applied Math."},{"issue":"6","key":"34_CR13","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/34.601253","volume":"19","author":"P.L. Rosin","year":"1997","unstructured":"Rosin, P.L.: Techniques for assessing polygonal approximations of curves. IEEE Transactions on PAMI\u00a019(6), 659\u2013666 (1997)","journal-title":"IEEE Transactions on PAMI"},{"key":"34_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1090\/conm\/119\/1113908","volume":"119","author":"A.W.M. Smeulders","year":"1991","unstructured":"Smeulders, A.W.M., Dorst, L.: Decomposition of discrete curves into piecewise straight segments in linear time. Contemporary Mathematics\u00a0119, 169\u2013195 (1991)","journal-title":"Contemporary Mathematics"},{"issue":"2","key":"34_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1142\/S0218001400000167","volume":"14","author":"P. Yin","year":"2000","unstructured":"Yin, P.: A tabu search approach to polygonal approximation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence\u00a014(2), 243\u2013255 (2000)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"1","key":"34_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.patcog.2003.07.008","volume":"37","author":"D. Zhang","year":"2004","unstructured":"Zhang, D., Lu, G.: Review of shape representation and description techniques. Pattern Recognition\u00a037(1), 1\u201319 (2004)","journal-title":"Pattern Recognition"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31965-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:35:58Z","timestamp":1558287358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31965-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255130","9783540319658"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31965-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}