{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:41:49Z","timestamp":1725770509270},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642539251"},{"type":"electronic","value":"9783642539268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-53926-8_6","type":"book-chapter","created":{"date-parts":[[2014,1,21]],"date-time":"2014-01-21T12:30:46Z","timestamp":1390307446000},"page":"59-70","source":"Crossref","is-referenced-by-count":1,"title":["Digital Convexity and Cavity Trees"],"prefix":"10.1007","author":[{"given":"Gisela","family":"Klette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-79126-3_7","volume-title":"Discrete Geometry for Computer Imagery","author":"S. Brlek","year":"2008","unstructured":"Brlek, S., Lachaud, J.-O., Proven\u00e7al, X.: Combinatorial view of digital convexity. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol.\u00a04992, pp. 57\u201368. Springer, Heidelberg (2008)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(02)00227-5","volume":"125","author":"I. Debled-Rennesson","year":"2003","unstructured":"Debled-Rennesson, I., Remy, J.-L., Rouyer-Degli, J.: Detection of discrete convexity of polyominoes. Discrete Applied Mathematics\u00a0125, 115\u2013133 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR3","first-page":"145","volume":"31","author":"H. Doerksen-Reiter","year":"2006","unstructured":"Doerksen-Reiter, H., Debled-Rennesson, I.: Convex and concave parts of digital curves. Computational Imaging and Vision\u00a031, 145\u2013160 (2006)","journal-title":"Computational Imaging and Vision"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00453-003-1040-7","volume":"38","author":"U. Eckhardt","year":"2004","unstructured":"Eckhardt, U., Doerksen-Reiter, H.: Polygonal representations of digital sets. Algorithmica\u00a038(1), 5\u201323 (2004)","journal-title":"Algorithmica"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1112\/S0025579311001318","volume":"57","author":"C.O. Kiselman","year":"2011","unstructured":"Kiselman, C.O.: Characterizing digital straightness and digital convexity by means of difference operators. Mathematika\u00a057, 355\u2013380 (2011)","journal-title":"Mathematika"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1011289414377","volume":"13","author":"R. Klette","year":"2000","unstructured":"Klette, R., Zunic, J.: Multigrid convergence of calculated features in image analysis. J. Mathematical Imaging Vision\u00a013, 173\u2013191 (2000)","journal-title":"J. Mathematical Imaging Vision"},{"key":"6_CR7","volume-title":"Digital Geometry \u2013 Geometric Methods for Digital Picture Analysis","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry \u2013 Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-19867-0_22","volume-title":"Discrete Geometry for Computer Imagery","author":"G. Klette","year":"2011","unstructured":"Klette, G.: Recursive calculation of relative convex hulls. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol.\u00a06607, pp. 260\u2013271. Springer, Heidelberg (2011)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.cviu.2012.08.018","volume":"117","author":"G. Klette","year":"2012","unstructured":"Klette, G.: Recursive Computation of Minimum-Length Polygons. Computer Vision and Image Understanding\u00a0117, 386\u2013392 (2012)","journal-title":"Computer Vision and Image Understanding"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1109\/TPAMI.1982.4767315","volume":"4","author":"C.E. Kim","year":"1982","unstructured":"Kim, C.E.: Digital convexity, straightness, and convex polygons. PAMI\u00a04, 618\u2013626 (1982)","journal-title":"PAMI"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/TPAMI.1982.4767221","volume":"4","author":"C.E. Kim","year":"1982","unstructured":"Kim, C.E., Rosenfeld, A.: Digital straight lines and convexity of digital regions. PAMI\u00a04, 149\u2013153 (1982)","journal-title":"PAMI"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1016\/j.imavis.2006.06.019","volume":"25","author":"J.O. Lachaud","year":"2007","unstructured":"Lachaud, J.O., Vialard, A., de Vieilleville, F.: Fast, accurate and convergent tangent estimation on digital contours. Image and Vision Computing\u00a025, 1572\u20131587 (2007)","journal-title":"Image and Vision Computing"},{"key":"6_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2256-2","volume-title":"Euclidean Shortest Paths","author":"F. Li","year":"2011","unstructured":"Li, F., Klette, R.: Euclidean Shortest Paths. Springer, London (2011)"},{"key":"6_CR14","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":"6_CR15","volume-title":"Perceptrons","author":"M. Minsky","year":"1969","unstructured":"Minsky, M., Papert, S.: Perceptrons. MIT Press, Reading (1969)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-04397-0_10","volume-title":"Discrete Geometry for Computer Imagery","author":"X. Proven\u00e7al","year":"2009","unstructured":"Proven\u00e7al, X., Lachaud, J.-O.: Two linear-time algorithms for computing the minimum length polygon of a digital contour. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol.\u00a05810, pp. 104\u2013117. Springer, Heidelberg (2009)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Papadopoulus, A.: Metric Spaces, Convexity and Nonpositive Curvature. European Mathematical Society (2005)","DOI":"10.4171\/010"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-10210-3_4","volume-title":"Combinatorial Image Analysis","author":"T. Roussillon","year":"2009","unstructured":"Roussillon, T., Tougne, L., Sivignon, I.: What does digital straightness tell about digital convexity? In: Wiederhold, P., Barneva, R.P. (eds.) IWCIA 2009. LNCS, vol.\u00a05852, pp. 43\u201355. Springer, Heidelberg (2009)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"2693","DOI":"10.1016\/j.patcog.2011.03.018","volume":"44","author":"T. Roussillon","year":"2011","unstructured":"Roussillon, T., Sivignon, I.: Reversible polygon that faithfully represents the convex and concave parts of a digital curve. Pattern Recognition\u00a044, 2693\u20132700 (2011)","journal-title":"Pattern Recognition"},{"key":"6_CR20","volume-title":"Picture Processing by Computer","author":"A. Rosenfeld","year":"1969","unstructured":"Rosenfeld, A.: Picture Processing by Computer. Academic Press, New York (1969)"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0031-3203(70)90037-3","volume":"2","author":"J. Sklansky","year":"1970","unstructured":"Sklansky, J.: Recognition of convex blobs. Pattern Recognition\u00a02, 3\u201310 (1970)","journal-title":"Pattern Recognition"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1109\/T-C.1972.223507","volume":"21","author":"J. Sklansky","year":"1972","unstructured":"Sklansky, J.: Measuring cavity on a rectangular mosaic. IEEE Trans. Computing\u00a021, 1355\u20131364 (1972)","journal-title":"IEEE Trans. Computing"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0377-0427(94)90040-X","volume":"55","author":"F. Sloboda","year":"1994","unstructured":"Sloboda, F., Stoer, J.: On piecewise linear approximation of planar Jordan curves. J. Computational and Applied Mathematics\u00a055, 369\u2013383 (1994)","journal-title":"J. Computational and Applied Mathematics"},{"key":"6_CR24","unstructured":"Sloboda, F., Zatko, B., Stoer, J.: On approximation of planar one dimensional continua. In: Klette, R., Rosenfeld, A., Sloboda, F. (eds.) Advances in Digital and Computational Geometry, pp. 113\u2013160 (1998)"}],"container-title":["Lecture Notes in Computer Science","Image and Video Technology \u2013 PSIVT 2013 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53926-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T03:34:32Z","timestamp":1558841672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53926-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642539251","9783642539268"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53926-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}