{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:25:46Z","timestamp":1734067546214,"version":"3.30.2"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphical Models"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1524-0703(03)00008-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"61-76","source":"Crossref","is-referenced-by-count":23,"title":["A linear incremental algorithm for naive and standard digital lines and planes recognition"],"prefix":"10.1016","volume":"65","author":[{"given":"Lilian","family":"Buzer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1524-0703(03)00008-0_BIB1","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/299917.299918","article-title":"Efficient algorithms for geometric optimization","volume":"30","author":"Agarwal","year":"1998","journal-title":"ACM Comput. Surveys"},{"year":"2000","author":"de Berg","series-title":"Computational Geometry: Algorithms and Applications","key":"10.1016\/S1524-0703(03)00008-0_BIB2"},{"key":"10.1016\/S1524-0703(03)00008-0_BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(86)90037-2","article-title":"Linear programming in O(n.23.d2) time","volume":"22","author":"Clarkson","year":"1986","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"K.L. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, in: Proceedings of the 29th Annual IEEE Symposium on Foundational Computer Science, 1998, pp. 452\u2013456","key":"10.1016\/S1524-0703(03)00008-0_BIB4","DOI":"10.1109\/SFCS.1988.21961"},{"issue":"6","key":"10.1016\/S1524-0703(03)00008-0_BIB5","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1142\/S0218001495000249","article-title":"A linear algorithm for segmentation of digital curves","volume":"9","author":"Debled-Rennesson","year":"1995","journal-title":"Internat. J. Pattern Recognition Artificial Intell."},{"unstructured":"I. Debled-Rennesson, \u00c9tude et reconnaissance de droites et plans discrets, Th\u00e8se de doctorat, Universit\u00e9 Louis Pasteur, Strasbourg, 1995","key":"10.1016\/S1524-0703(03)00008-0_BIB6"},{"year":"1987","author":"Edelsbrunner","series-title":"Algorithms in Combinatorial Geometry","key":"10.1016\/S1524-0703(03)00008-0_BIB7"},{"key":"10.1016\/S1524-0703(03)00008-0_BIB8","series-title":"DGCI\u201996","first-page":"141","article-title":"Recognizing arithmetic straight lines and planes","volume":"vol. 1176","author":"Fran\u00e7on","year":"1996"},{"key":"10.1016\/S1524-0703(03)00008-0_BIB9","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1524-0703(03)00008-0_BIB10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S1524-0703(03)00008-0_BIB11","series-title":"Computational Geometry: An Introduction","first-page":"268","author":"Preparata","year":"1985"},{"unstructured":"J.P. Reveill\u00e8s, G\u00e9ometrie discr\u00e8te, calculs en nombre entiers et algorithmique, Th\u00e8se d\u2019\u00e9tat, Universit\u00e9 Louis Pasteur, Strasbourg, 1991","key":"10.1016\/S1524-0703(03)00008-0_BIB12"},{"key":"10.1016\/S1524-0703(03)00008-0_BIB13","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF02574699","article-title":"Small-dimensional linear programming and convex hulls made easy","volume":"6","author":"Seidel","year":"1991","journal-title":"Discrete Comput. Geom."},{"unstructured":"J. Vittone, Caract\u00e9risation et reconnaissance de droites et de plans en G\u00e9om\u00e9trie discr\u00e8te, Th\u00e8se de Doctorat, Universit\u00e9 Joseph Fourier, Grenoble, 1999","key":"10.1016\/S1524-0703(03)00008-0_BIB14"}],"container-title":["Graphical Models"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1524070303000080?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1524070303000080?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T14:09:10Z","timestamp":1734012550000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1524070303000080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1524070303000080"],"URL":"https:\/\/doi.org\/10.1016\/s1524-0703(03)00008-0","relation":{},"ISSN":["1524-0703"],"issn-type":[{"type":"print","value":"1524-0703"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}