{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T10:01:52Z","timestamp":1751536912820},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540351535"},{"type":"electronic","value":"9783540351542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11774938_23","type":"book-chapter","created":{"date-parts":[[2006,6,14]],"date-time":"2006-06-14T06:07:45Z","timestamp":1150265265000},"page":"291-306","source":"Crossref","is-referenced-by-count":9,"title":["Computational Aspects of Digital Plane and Hyperplane Recognition"],"prefix":"10.1007","author":[{"given":"David","family":"Coeurjolly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Brimkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Qhull, http:\/\/www.qhull.org\/"},{"issue":"69","key":"23_CR2","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/0097-3165(95)90058-6","volume":"Serie A","author":"D.M. Acketa","year":"1995","unstructured":"Acketa, D.M., \u017duni\u0107, J.D.: On the maximal number of edges of convex digital polygons included into a m\u00d7m-grid. Journal of Combinatorial Theory\u00a0Serie A(69), 358\u2013368 (1995)","journal-title":"Journal of Combinatorial Theory"},{"issue":"5","key":"23_CR3","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/gmip.1997.0427","volume":"59","author":"E. Andres","year":"1997","unstructured":"Andres, E., Acharya, R., Sibata, C.: Discrete analytical hyperplanes. Graphical Models and Image Processing\u00a059(5), 302\u2013309 (1997)","journal-title":"Graphical Models and Image Processing"},{"key":"23_CR4","unstructured":"Avis, D.: lrs: implementation as a callable library of the reverse search algorithm for vertex enumeration\/convex hull problems, http:\/\/cgm.cs.mcgill.ca\/~avis\/C\/lrs.html"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/109648.109666","volume-title":"Proceedings of the 7th Annual Symposium on Computational Geometry (SCG 1991)","author":"A. Balog","year":"1991","unstructured":"Balog, A., B\u00e1r\u00e1ny, I.: On the convex hull of the integer points in a disc. In: ACM -SIGACT ACM-SIGGRAPH (ed.) Proceedings of the 7th Annual Symposium on Computational Geometry (SCG 1991), North Conway, NH, USA, June 1991, pp. 162\u2013165. ACM Press, New York (1991)"},{"key":"23_CR6","unstructured":"Barany, I.: Random points, convex bodies, lattices. In: ICM: Proceedings of the International Congress of Mathematicians (2002)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Barany, I., Howe, Lovasz: On integer points in polyhedra: A lower bound. Combinatorica\u00a012 (1992)","DOI":"10.1007\/BF01204716"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s002080050217","volume":"312","author":"I. B\u00e1r\u00e1ny","year":"1998","unstructured":"B\u00e1r\u00e1ny, I., Larman, D.G.: The convex hull of the integer points in a large ball. Math. Annalen\u00a0312, 167\u2013181 (1998)","journal-title":"Math. Annalen"},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"C.B. Barber","year":"1996","unstructured":"Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software\u00a022(4), 469\u2013483 (1996)","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"1-2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(98)00346-6","volume":"246","author":"R.P. Barneva","year":"2000","unstructured":"Barneva, R.P., Brimkov, V.E., Nehlig, P.: Thin discrete triangular meshes. Theoretical Computer Science\u00a0246(1-2), 73\u2013105 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/PL00009410","volume":"21","author":"D. Bremner","year":"1999","unstructured":"Bremner, D.: Incremental convex hull algorithms are not output sensitive. Discrete & Computational Geometry\u00a021(1), 57\u201368 (1999)","journal-title":"Discrete & Computational Geometry"},{"key":"23_CR12","unstructured":"Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity - a review. Technical report, Laboratoire LIRIS, Universit\u00e9 Claude Bernard Lyon 1 (2004), http:\/\/liris.cnrs.fr\/publis\/?id=1933"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-31965-8_27","volume-title":"Discrete Geometry for Computer Imagery","author":"V.E. Brimkov","year":"2005","unstructured":"Brimkov, V.E., Dantchev, S.S.: Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension. In: Andr\u00e8s, \u00c9., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol.\u00a03429, pp. 287\u2013298. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S1524-0703(03)00008-0","volume":"65","author":"L. Buzer","year":"2003","unstructured":"Buzer, L.: A linear incremental algorithm for naive and standard digital lines and planes recognition. Graphical Models\u00a065(1-3), 61\u201376 (2003)","journal-title":"Graphical Models"},{"key":"23_CR15","unstructured":"Coeurjolly, D.: Algorithmique et g\u00e9om\u00e9trie discr\u00e8te pour la caract\u00e9risation des courbes et des surfaces. PhD thesis, Universit\u00e9 Lumi\u00e8re Lyon 2, Bron, Laboratoire ERIC (December 2002)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Coeurjolly, D., Guillaume, A., Sivignon, I.: Reversible discrete volume polyhedrization using marching cubes simplification. In: SPIE Vision Geometry XII, San Jose, USA, vol.\u00a05300, pp. 1\u201311 (2004)","DOI":"10.1117\/12.525391"},{"issue":"1\u20133","key":"23_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.dam.2005.02.022","volume":"151","author":"D. Coeurjolly","year":"2005","unstructured":"Coeurjolly, D., Sivignon, I., Dupont, F., Feschet, F., Chassery, J.-M.: On digital plane preimage structure. Discrete Applied Mathematics\u00a0151(1\u20133), 78\u201392 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR18","unstructured":"Debled-Rennesson, I.: Etude et reconnaissance des droites et plans discrets. PhD thesis, Universit\u00e9 Louis Pasteur (1995)"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","first-page":"141","volume-title":"Discrete Geometry for Computer Imagery","author":"J. Fran\u00e7on","year":"1996","unstructured":"Fran\u00e7on, J., Schramm, J.M., Tajine, M.: Recognizing arithmetic straight lines and planes. In: Miguet, S., Ub\u00e9da, S., Montanvert, A. (eds.) DGCI 1996. LNCS, vol.\u00a01176, pp. 141\u2013150. Springer, Heidelberg (1996)"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/3-540-49126-0_33","volume-title":"Discrete Geometry for Computer Imagery","author":"J. Fran\u00e7on","year":"1999","unstructured":"Fran\u00e7on, J., Papier, L.: Polyhedrization of the boundary of a voxel object. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol.\u00a01568, pp. 425\u2013434. Springer, Heidelberg (1999)"},{"key":"23_CR21","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Gerard, Y., Debled-Rennesson, I., Zimmermann, P.: An elementary digital plane recognition algorithm. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science\u00a0151 (2005)","DOI":"10.1016\/j.dam.2005.02.026"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/TPAMI.1984.4767578","volume":"6","author":"C.E. Kim","year":"1984","unstructured":"Kim, C.E.: Three-dimensional digital planes. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a06, 639\u2013645 (1984)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"11","key":"23_CR24","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/0167-8655(91)90003-5","volume":"12","author":"C.E. Kim","year":"1991","unstructured":"Kim, C.E., Stojmenovic, I.: On the recognition of digital planes in three-dimensional space. Pattern Recognition Letters\u00a012(11), 665\u2013669 (1991)","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"23_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/gmip.1996.0024","volume":"58","author":"R. Klette","year":"1996","unstructured":"Klette, R., Stojmenovic, I., Zunic, J.D.: A parametrization of digital planes by least-squares fits and generalizations. CVGIP: Graphical Model and Image Processing\u00a058(3), 295\u2013300 (1996)","journal-title":"CVGIP: Graphical Model and Image Processing"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-45129-3_32","volume-title":"Visual Form 2001","author":"R. Klette","year":"2001","unstructured":"Klette, R., Sun, H.J.: Digital planar segment based polyhedrization for surface area estimation. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol.\u00a02059, pp. 356\u2013366. Springer, Heidelberg (2001)"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. JACM: Journal of the ACM\u00a031 (1984)","DOI":"10.1145\/2422.322418"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-45986-3_36","volume-title":"Discrete Geometry for Computer Imagery","author":"M.M. Mesmoudi","year":"2002","unstructured":"Mesmoudi, M.M.: A simplified recognition algorithm of digital planes pieces. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol.\u00a02301, pp. 404\u2013416. Springer, Heidelberg (2002)"},{"key":"23_CR29","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":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Rosenfeld, A.: Digital straight lines segments. IEEE Transactions on Computers, 1264\u20131369 (1974)","DOI":"10.1109\/T-C.1974.223845"},{"key":"23_CR31","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Int. Workshop on Combinatorial Image Analysis","author":"A. Rosenfeld","year":"2001","unstructured":"Rosenfeld, A., Klette, R.: Digital straightness. In: Int. Workshop on Combinatorial Image Analysis. Electronic Notes in Theoretical Computer Science, vol.\u00a046. Elsevier Science Publishers, Amsterdam (2001)"},{"key":"23_CR32","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley and Sons, Chichester (1986)"},{"key":"23_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-36586-9_23","volume-title":"Geometry, Morphology, and Computational Imaging","author":"I. Sivignon","year":"2003","unstructured":"Sivignon, I., Coeurjolly, D.: From digital plane segmentation to polyhedral representation. In: Asano, T., Klette, R., Ronse, C. (eds.) Geometry, Morphology, and Computational Imaging. LNCS, vol.\u00a02616, pp. 356\u2013367. Springer, Heidelberg (2003)"},{"issue":"1","key":"23_CR34","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1041-6","volume":"38","author":"I. Sivignon","year":"2003","unstructured":"Sivignon, I., Dupont, F., Chassery, J.M.: Decomposition of a three-dimensional discrete object surface into discrete plane pieces. Algorithmica\u00a038(1), 25\u201343 (2003)","journal-title":"Algorithmica"},{"key":"23_CR35","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1090\/conm\/119\/1113909","volume-title":"Vision Geometry, contemporary Mathematics Series","author":"I. Stojmenovi\u0107","year":"1991","unstructured":"Stojmenovi\u0107, I., Tosi\u0107, R.: Digitization schemes and the recognition of digital straight lines, hyperplanes and flats in arbitrary dimensions. In: Vision Geometry, contemporary Mathematics Series, vol.\u00a0119, pp. 197\u2013212. American Mathematical Society, Providence (1991)"},{"key":"23_CR36","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01250530","volume":"3","author":"P. Veelaert","year":"1993","unstructured":"Veelaert, P.: On the flatness of digital hyperplanes. Journal of Mathematical Imaging and Vision\u00a03, 205\u2013221 (1993)","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"6","key":"23_CR37","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/34.295909","volume":"16","author":"P. Veelaert","year":"1994","unstructured":"Veelaert, P.: Digital planarity of rectangular surface segments. IEEE Pattern Analysis and Machine Intelligence\u00a016(6), 647\u2013652 (1994)","journal-title":"IEEE Pattern Analysis and Machine Intelligence"},{"key":"23_CR38","series-title":"Lecture Notes in Computer Science","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":"Vittone, J., Chassery, J.-M.: Recognition of digital naive planes and polyhedization. In: Nystr\u00f6m, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol.\u00a01953, pp. 296\u2013307. Springer, Heidelberg (2000)"},{"key":"23_CR39","unstructured":"Zolotykh, N.Y.: On the number of vertices in integer linear programming problems. Technical report, University of Nizhni Novgorod (2000)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11774938_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:21Z","timestamp":1619507661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11774938_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540351535","9783540351542"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/11774938_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}