{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:03:09Z","timestamp":1725559389477},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540263203"},{"type":"electronic","value":"9783540315667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499145_92","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T09:48:02Z","timestamp":1279100882000},"page":"910-919","source":"Crossref","is-referenced-by-count":3,"title":["Fast Guaranteed Polygonal Approximations of Closed Digital Curves"],"prefix":"10.1007","author":[{"given":"Fabien","family":"Feschet","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"92_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0167-8655(96)00116-X","volume":"18","author":"P. Cornic","year":"1997","unstructured":"Cornic, P.: Another look at the dominant point detection of digital curves. Pattern Recognition Letters\u00a018, 13\u201325 (1997)","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"92_CR2","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D.H. Douglas","year":"1973","unstructured":"Douglas, D.H., Pleucker, T.K.: Algorithm for the reduction of the number of points required to represent a line or its caricature. The Canadian Cartographer\u00a010(2), 112\u2013122 (1973)","journal-title":"The Canadian Cartographer"},{"key":"92_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-31965-8_34","volume-title":"Discrete Geometry for Computer Imagery","author":"I. Debled-Rennesson","year":"2005","unstructured":"Debled-Rennesson, I., Feschet, F., Rouyer, J.: Optimal blurred segments decomposition in linear time. In: Andr\u00e8s, \u00c9., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol.\u00a03429, pp. 371\u2013382. Springer, Heidelberg (2005)"},{"key":"92_CR4","doi-asserted-by":"crossref","unstructured":"Feschet, F.: Canonical representations of discrete curves. Pattern Analysis and Applications (2005) (Accepted for publication, to appear)","DOI":"10.1007\/s10044-005-0246-5"},{"key":"92_CR5","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)"},{"key":"92_CR6","doi-asserted-by":"crossref","unstructured":"Feschet, F., Tougne, L.: On the Min DSS Problem of Closed Discrete Curves. In: Del Lungo, A., Di Ges\u00f9, V., Kuba, A. (eds.) IWCIA. ENDM, vol.\u00a012. Elsevier, Amsterdam (2003)","DOI":"10.1016\/S1571-0653(04)00496-2"},{"key":"92_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-8655(01)00098-8","volume":"23","author":"J.-H. Horng","year":"2002","unstructured":"Horng, J.-H., Li, J.T.: An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves. Pattern Recognition Letters\u00a023, 171\u2013182 (2002)","journal-title":"Pattern Recognition Letters"},{"key":"92_CR8","first-page":"71","volume-title":"Computational Morphology","author":"H. Imai","year":"1988","unstructured":"Imai, H., Iri, M.: Polygonal approximations of a curve (formulations and algorithms). In: Toussaint, G.T. (ed.) Computational Morphology, pp. 71\u201386. North-Holland, Amsterdam (1988)"},{"key":"92_CR9","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1016\/S0167-8655(03)00051-5","volume":"24","author":"A. Kolesnikov","year":"2004","unstructured":"Kolesnikov, A., Fr\u00e4nti, P.: Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters\u00a024, 2243\u20132254 (2004)","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"92_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/cviu.1998.0738","volume":"73","author":"L.J. Latecki","year":"1999","unstructured":"Latecki, L.J., Lak\u00e4mper, R.: Convexity rule for shape decomposition based on discrete contour evolution. Computer Vision and Image Understanding\u00a073(3), 441\u2013454 (1999)","journal-title":"Computer Vision and Image Understanding"},{"key":"92_CR11","unstructured":"Marji, M.: On the detection of dominant points on digital planar curves. PhD thesis, Graduate School, Wayne State University (2003)"},{"issue":"11","key":"92_CR12","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1016\/j.patcog.2004.03.004","volume":"37","author":"M. Marji","year":"2004","unstructured":"Marji, M., Siy, P.: Polygonal representation of digital planar curves through dominant point detection - a nonparametric algorithm. Pattern Recognition\u00a037(11), 2113\u20132130 (2004)","journal-title":"Pattern Recognition"},{"key":"92_CR13","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/0167-8655(94)90002-7","volume":"15","author":"J.-C. Perez","year":"1994","unstructured":"Perez, J.-C., Vidal, E.: Optimum polygonal approximation of digitized curves. Pattern Recognition Letters\u00a015, 743\u2013750 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"1\u20133","key":"92_CR14","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."},{"key":"92_CR15","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/0167-8655(92)90084-D","volume":"13","author":"B.K. Ray","year":"1992","unstructured":"Ray, B.K., Ray, K.S.: An algorithm for detecting dominant points and polygonal approximation of digitized curves. Pattern Recognition Letters\u00a013, 849\u2013856 (1992)","journal-title":"Pattern Recognition Letters"},{"key":"92_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-8655(00)00088-X","volume":"22","author":"M. Salotti","year":"2001","unstructured":"Salotti, M.: An efficient algorithm for the optimal polygonal approximation of digitized curves. Pattern Recognition Letters\u00a022, 215\u2013221 (2001)","journal-title":"Pattern Recognition Letters"},{"key":"92_CR17","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0031-3203(01)00051-6","volume":"35","author":"M. Salotti","year":"2002","unstructured":"Salotti, M.: Optimal polygonal approximation of digitized curves using the sum of square deviations criterion. Pattern Recognition\u00a035, 435\u2013443 (2002)","journal-title":"Pattern Recognition"},{"key":"92_CR18","volume-title":"Combinatorial Optimization - Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"92_CR19","doi-asserted-by":"publisher","first-page":"2869","DOI":"10.1016\/S0167-8655(03)00145-4","volume":"24","author":"B. Sarkar","year":"2003","unstructured":"Sarkar, B., Roy, S., Sarkar, D.: Hierarchical representation of digitized curves through dominant point detection. Pattern Recognition Letters\u00a024, 2869\u20132882 (2003)","journal-title":"Pattern Recognition Letters"},{"issue":"8","key":"92_CR20","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/34.31447","volume":"11","author":"C.-H. Teh","year":"1989","unstructured":"Teh, C.-H., Chin, R.T.: On the detection of dominant points on digital curves. IEEE Trans. Pattern Anal. and Machine Intell.\u00a011(8), 859\u2013872 (1989)","journal-title":"IEEE Trans. Pattern Anal. and Machine Intell."},{"issue":"1\u20133","key":"92_CR21","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\u20133), 1\u201319 (2004)","journal-title":"Pattern Recognition"}],"container-title":["Lecture Notes in Computer Science","Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499145_92.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:41:48Z","timestamp":1619505708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499145_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540263203","9783540315667"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11499145_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}