{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:31:31Z","timestamp":1725489091889},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433804"},{"type":"electronic","value":"9783540459866"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45986-3_29","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:05:17Z","timestamp":1186905917000},"page":"326-337","source":"Crossref","is-referenced-by-count":2,"title":["Visibility in Discrete Geometry: An Application to Discrete Geodesic Paths"],"prefix":"10.1007","author":[{"given":"David","family":"Coeurjolly","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S0734-189X(86)80047-0","volume":"34","author":"G. Borgefors","year":"1986","unstructured":"G. Borgefors. Distance transformations in digital images. Computer Vision, Graphics, and Image Processing, 34(3):344\u2013371, June 1986.","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"29_CR2","unstructured":"J.P. Braquelaire and P. Moreau. Error free construction of generalized euclidean distance maps and generalized discrete vorono\u00ef diagrams. Technical report, Universit\u00e9 Bordeaux, Laboratoire LaBRI, 1994."},{"key":"29_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Digital and Image Geometry","author":"D. Coeurjolly","year":"2001","unstructured":"D. Coeurjolly, I. Debled-Rennesson, and O. Teytaud. Segmentation and length estimation of 3d discrete curves. In Digital and Image Geometry. to appear, Springer Lecture Notes in Computer Science, 2001."},{"key":"29_CR4","unstructured":"O. Cuisenaire. Distrance Transformations: Fast Algorithms and Applications to Medical Image Processing. PhD thesis, Universit\u00e9 Catholique de Louvain, oct 1999."},{"key":"29_CR5","first-page":"227","volume":"14","author":"P.E. Danielsson","year":"1980","unstructured":"P.E. Danielsson. Euclidean distance mapping. CGIP, 14:227\u2013248, 1980.","journal-title":"CGIP"},{"key":"29_CR6","unstructured":"I. Debled-Rennesson. Etude et reconnaissance des droites et plans discrets. PhD thesis, Th\u00e8se. Universit\u00e9 Louis Pasteur, Strasbourg, 1995."},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1142\/S0218001495000249","volume":"9","author":"I. Debled-Rennesson","year":"1995","unstructured":"I. Debled-Rennesson and J.P. Reveill\u00e8s. A linear algorithm for segmentation of digital curves. In International Journal of Pattern Recognition and Artificial Intelligence, volume 9, pages 635\u2013662, 1995.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"G. Sanniti di Baja and S. Svensson. Detecting centres of maximal discs. Discrete Geometry for Computer Imagery, pages 443\u2013452, 2000.","DOI":"10.1007\/3-540-44438-6_36"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"L. Dorst and A.W.M. Smeulders. Decomposition of discrete curves into piecewise straight segments in linear time. In Contemporary Mathematics, volume 119, 1991.","DOI":"10.1090\/conm\/119\/1113908"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"J. Fran\u00e7on, J.M. Schramm, and M. Tajine. Recognizing arithmetic straight lines and planes. Discrete Geometry for Computer Imagery, 1996.","DOI":"10.1007\/3-540-62005-2_12"},{"issue":"11","key":"29_CR11","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1016\/S0031-3203(97)00011-3","volume":"30","author":"A. Jonas","year":"1997","unstructured":"A. Jonas and N. Kiryati. Digital representation schemes for 3d curves. Pattern Recognition, 30(11):1803\u20131816, 1997.","journal-title":"Pattern Recognition"},{"issue":"11","key":"29_CR12","doi-asserted-by":"publisher","first-page":"1623","DOI":"10.1016\/0031-3203(93)90018-R","volume":"26","author":"N. Kiryati","year":"1993","unstructured":"N. Kiryati and G. Sz\u00e9kely. Estimating shortest paths and minimal distances on digitized three-dimension surfaces. Pattern Recognition, 26(11):1623\u20131637, 1993.","journal-title":"Pattern Recognition"},{"key":"29_CR13","unstructured":"R. Klette and J. Zunic. Convergence of calculated features in image analysis. Technical Report CITR-TR-52, University of Auckland, 1999."},{"key":"29_CR14","unstructured":"V. Kovalevsky and S. Fuchs. Theoritical and experimental analysis of the accuracy of perimeter estimates. In Robust Computer Vision, pages 218\u2013242, 1992."},{"issue":"9","key":"29_CR15","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/34.232082","volume":"15","author":"M. Lindenbaum","year":"1993","unstructured":"M. Lindenbaum and A. Bruckstein. On recursive, o(n) partitioning of a digitized curve into digital straigth segments. IEEE Transactions on PatternAnalysis and Machine Intelligence, PAMI-15(9):949\u2013953, september 1993.","journal-title":"IEEE Transactions on PatternAnalysis and Machine Intelligence"},{"issue":"2","key":"29_CR16","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/j.1538-7305.1985.tb00359.x","volume":"64","author":"M. D. McIlroy","year":"1985","unstructured":"M. D. McIlroy. A note on discrete representation of lines. Atandt Tech. J., 64(2, Pt. 2):481\u2013490, February 1985.","journal-title":"Atandt Tech. J."},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"N. Megiddo. Linear programming in linear time when the dimension is fixed. Journal of the ACM, 31(1):114\u2013127, January 1984.","journal-title":"Journal of the ACM"},{"key":"29_CR18","unstructured":"P. Moreau. Mod\u00e9lisation et g\u00e9n\u00e9ration de d\u00e9grad\u00e9s dans le plan discret. PhD thesis, Universit\u00e9 Bordeaux I, 1995."},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/0031-3203(87)90030-6","volume":"20","author":"J. Piper","year":"1987","unstructured":"J. Piper and E. Granum. Computing distance transformations in convex and nonconvex domains. Pattern Recognition, 20:599\u2013615, 1987.","journal-title":"Pattern Recognition"},{"key":"29_CR20","unstructured":"I. Ragnemalm. Contour processing distance transforms, pages 204\u2013211. World Scientific, 1990."},{"issue":"4","key":"29_CR21","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/34.19041","volume":"11","author":"B. J. H. Verwer","year":"1989","unstructured":"B. J. H. Verwer, P. W. Verbeek, and S.T Dekker. An efficient uniform cost algorithm applied to distance transforms. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-11(4):425\u2013429, April 1989.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/0167-8655(91)90004-6","volume":"12","author":"B.J.H. Verwer","year":"1991","unstructured":"B.J.H Verwer. Local distances for distance transformations in two and three dimensions. Pattern Recognition Letters, 12:671\u2013682, november 1991.","journal-title":"Pattern Recognition Letters"},{"key":"29_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-44438-6_25","volume-title":"Discrete Geometry for Computer Imagery","author":"J. Vittone","year":"2000","unstructured":"J. Vittone and J.M. Chassery. Recognition of digital naive planes and polyhedization. In Discrete Geometry for Computer Imagery, number 1953 in Lecture Notes in Computer Science, pages 296\u2013307. Springer, 2000."},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TPAMI.1982.4767258","volume":"4","author":"L.D. Wu","year":"1982","unstructured":"L.D. Wu. On the chain code of a line. IEEE Trans. Pattern Analysis and Machine Intelligence, 4:347\u2013353, 1982.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45986-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:59:30Z","timestamp":1556755170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45986-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433804","9783540459866"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45986-3_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}