{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:31:21Z","timestamp":1725489081070},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_33","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:05:17Z","timestamp":1186891517000},"page":"372-381","source":"Crossref","is-referenced-by-count":13,"title":["An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem"],"prefix":"10.1007","author":[{"given":"Lilian","family":"Buzer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P. K. Agarwal","year":"1998","unstructured":"Pankaj K. Agarwal and Micha Sharir (1998). Efficient algorithms for geometric optimization. ACM Comput. Surv., vol. 30, pp. 412\u2013458.","journal-title":"ACM Comput. Surv."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf (2000). Computational Geometry: Algorithms and Applications (2nd ed.). Springer-Verlag.","DOI":"10.1007\/978-3-662-04245-8"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(86)90037-2","volume":"22","author":"K.L. Clarkson","year":"1986","unstructured":"K.L. Clarkson (1986). Linear Programming in O(n.23.d\n                           \n                           2 ) time. Inform. Process. Lett., vol. 22, pp. 21\u201324.","journal-title":"Inform. Process. Lett."},{"key":"33_CR4","unstructured":"K.L. Clarkson (1998). A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci., pp. 452\u2013456."},{"issue":"6","key":"33_CR5","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1142\/S0218001495000249","volume":"9","author":"I. Debled-Rennesson","year":"1995","unstructured":"I. Debled-Rennesson, J.-P. Reveill\u00e8s (1995). A linear algorithm for segmentation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence, vol. 9, no. 6, pp. 635\u2013662.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"33_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner (1987). Algorithms in Combinatorial Geometry. Springer-Verlag, New York."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo (1983). Linear-time algorithms for linear programming in \u211d3 and related problems. SIAM J. Comput., vol. 12, pp. 759\u2013776.","journal-title":"SIAM J. Comput."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"N. Megiddo (1984). Linear programming in linear time when the dimension is fixed. J. ACM, vol. 31, pp. 114\u2013127.","journal-title":"J. ACM"},{"key":"33_CR9","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":"F.P. Preparata and M.I. Shamos (1985). Computational Geometry: an Introduction. Springer-Verlag, New York."},{"key":"33_CR10","volume-title":"G\u00e9ometrie discr\u00e8te, calculs en nombre entiers et algorithmique","author":"J.P. Reveill\u00e8s","year":"1991","unstructured":"J.P. Reveill\u00e8s (1991). G\u00e9ometrie discr\u00e8te, calculs en nombre entiers et algorithmique. Th\u00e8se d\u2019\u00e9tat, Universit\u00e9 Louis Pasteur, Strasbourg."},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF02574699","volume":"6","author":"R. Seidel","year":"1991","unstructured":"R. Seidel (1991). Small-Dimensional Linear Programming and Convex Hulls Made Easy. Discrete and Computational Geometry, vol. 6, pp. 423\u2013434.","journal-title":"Discrete and Computational Geometry"}],"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_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T12:33:51Z","timestamp":1550752431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45986-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433804","9783540459866"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45986-3_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}