{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:17:28Z","timestamp":1725549448797},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255130"},{"type":"electronic","value":"9783540319658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31965-8_27","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:28:13Z","timestamp":1268400493000},"page":"287-298","source":"Crossref","is-referenced-by-count":3,"title":["Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension"],"prefix":"10.1007","author":[{"given":"Valentin E.","family":"Brimkov","sequence":"first","affiliation":[]},{"given":"Stefan S.","family":"Dantchev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Andres, E.: Mod\u00e9lisation Analytique Discr\u00e8\n                           te d\u2019Objets G\u00e9om\u00e9\n                           triques, Th\u00e8se de habilitation \u00e0 diriger des recherches, Universit\u2018\u2019e de Poitiers, Poitiers, France (2001)"},{"key":"27_CR2","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 Image Processing\u00a059, 302\u2013309 (1997)","journal-title":"Graphical Models Image Processing"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines. Bull. Amer. Math. Soc (NS)\u00a021, 1\u201346 (1989)","journal-title":"Bull. Amer. Math. Soc. (NS)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0167-8655(01)00139-8","volume":"23","author":"V.E. Brimkov","year":"2002","unstructured":"Brimkov, V.E., Andres, E., Barneva, R.P.: Object Discretizations in Higher Dimensions. Pattern Recognition Letters\u00a023, 623\u2013636 (2002)","journal-title":"Pattern Recognition Letters"},{"key":"27_CR5","unstructured":"Brimkov, V.E., Coeurjolly, D., Klette, R.: Digital Planarity - A Review, CITR-TR 142 (2004)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/jcom.1997.0446","volume":"13","author":"V.E. Brimkov","year":"1997","unstructured":"Brimkov, V.E., Danchev, S.S.: Real Data \u2013 Integer Solution Problems within the Blum-Shub-Smale Computational Model. J. of Complexity\u00a013, 279\u2013300 (1997)","journal-title":"J. of Complexity"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-44929-9_22","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"V.E. Brimkov","year":"2000","unstructured":"Brimkov, V.E., Dantchev, S.S.: On the complexity of integer programming in the blum-shub-smale computational model. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 286\u2013300. Springer, Heidelberg (2000)"},{"key":"27_CR8","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 Dines and Planes Recognition. Graphical Models\u00a065, 61\u201376 (2003)","journal-title":"Graphical Models"},{"key":"27_CR9","first-page":"12","volume-title":"Vision Geometry III","author":"I. Debled-Rennesson","year":"1994","unstructured":"Debled-Rennesson, I., Reveill\u00e8s, J.-P.: A New Approach to Digital Planes. In: Vision Geometry III, vol.\u00a02356, pp. 12\u201321. SPIE, San Jose (1994)"},{"key":"27_CR10","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":"27_CR11","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/0218059","volume":"18","author":"J. Hastad","year":"1989","unstructured":"Hastad, J., Just, B., Lagarias, J.C., Schnoor, C.P.: Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. SIAM J. Comput.\u00a018, 859\u2013881 (1989)","journal-title":"SIAM J. Comput."},{"key":"27_CR12","first-page":"475","volume-title":"24th Annual ACM Symposium on the Theory of Computation","author":"G. Kalai","year":"1992","unstructured":"Kalai, G.: A Subexponential Randomized Simplex Algorithm. In: 24th Annual ACM Symposium on the Theory of Computation, pp. 475\u2013482. ACM Press, New York (1992)"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"Kannan, R., Bachem, A.: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. SIAM J. Comput.\u00a08, 499\u2013507 (1979)","journal-title":"SIAM J. Comput."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/gmip.1996.0024","volume":"58","author":"R. Klette","year":"1996","unstructured":"Klette, R., Stojmenovi\u0107, I., \u017duni\u0107, J.: A Parametrization of Digital Planes by Least Square Fits and Generalizations. Graphical Models Image Processing\u00a058, 295\u2013300 (1996)","journal-title":"Graphical Models Image Processing"},{"key":"27_CR15","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.) Visual Form 2001, pp. 356\u2013366. Springer, Berlin (2001)"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer Programming with a Fixed Number of Variables. Math. Oper. Res.\u00a08, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Math. Ann.\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"issue":"1","key":"27_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear Programming in Linear Time when the Dimension is Fixed. J. of ACM\u00a031(1), 114\u2013127 (1984)","journal-title":"J. of ACM"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/jcom.1995.1002","volume":"11","author":"E. Novak","year":"1994","unstructured":"Novak, E.: The Real Number Model in Numerical Analysis. J. of Complexity\u00a011, 57\u201373 (1994)","journal-title":"J. of Complexity"},{"key":"27_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Heidelberg (1985)"},{"key":"27_CR21","unstructured":"Reveill\u00e8s, J.-P.: G\u00e9om\u00e9trie Discr\u00e8te, Calcul en Nombres Entiers et Algorithmique, Th\u00e8se d\u2019\u00e9tat, Univ. Louis Pasteur, Strasbourg (1991)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Rosenfeld, A., Klette, R.: Digital Straightness. Electronic Notes in Theoretical Computer Science\u00a046 (2001)","DOI":"10.1016\/S1571-0661(04)80976-9"},{"key":"27_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"27_CR24","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1090\/conm\/119\/1113909","volume":"119","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. Vision Geometry, Contemporary Mathematics Series\u00a0119, 197\u2013212 (1991)","journal-title":"Vision Geometry, Contemporary Mathematics Series"},{"key":"27_CR25","first-page":"633","volume-title":"Handbook of Theoretical Computer Science","author":"V. Strassen","year":"1990","unstructured":"Strassen, V.: Algebraic Complexity Theory. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 633\u2013672. Elsevier, Amsterdam (1990)"},{"key":"27_CR26","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 Int.\u00a016, 647\u2013652 (1994)","journal-title":"IEEE Pattern Analysis and Machine Int."},{"key":"27_CR27","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 polyhedrization. In: Nystr\u00f6m, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol.\u00a01953, pp. 296\u2013307. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31965-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:32:02Z","timestamp":1605760322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31965-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255130","9783540319658"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31965-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}