{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:15:13Z","timestamp":1780672513090,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642043963","type":"print"},{"value":"9783642043970","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04397-0_5","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:24:15Z","timestamp":1252938255000},"page":"46-56","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Lattice Width Computation in Arbitrary Dimension"],"prefix":"10.1007","author":[{"given":"\u00c9milie","family":"Charrier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lilian","family":"Buzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabien","family":"Feschet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1070\/rd1998v003n03ABEH000076","volume":"3","author":"V.I. Arnold","year":"1998","unstructured":"Arnold, V.I.: Higher dimensional continued fractions. Regular and chaotic dynamics\u00a03, 10\u201317 (1998)","journal-title":"Regular and chaotic dynamics"},{"key":"5_CR2","series-title":"Graduates Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/054","volume-title":"A Course in Convexity","author":"A. Barvinok","year":"2002","unstructured":"Barvinok, A.: A Course in Convexity. Graduates Studies in Mathematics, vol.\u00a054. Amer. Math. Soc, Providence (2002)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Boyce, J.E., Dobkin, D.P., Drysdale, R.L., Guibas, L.J.: Finding extremal polygons. In: STOC, pp. 282\u2013289 (1982)","DOI":"10.1145\/800070.802202"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01191202","volume":"12","author":"W. Cook","year":"1992","unstructured":"Cook, W., Hartman, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica\u00a012, 27\u201337 (1992)","journal-title":"Combinatorica"},{"key":"5_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., Schwarzkopf, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Debled-Rennesson, I., Reveill\u00e8s, J.-P.: A linear algorithm for segmentation of digital curves. IJPRAI\u00a09(4), 635\u2013662 (1995)","DOI":"10.1142\/S0218001495000249"},{"key":"5_CR7","first-page":"9","volume-title":"SFCS 1979: Proceedings of the 20th Annual Symposium on Foundations of Computer Science","author":"D.P. Dobkin","year":"1979","unstructured":"Dobkin, D.P., Snyder, L.: On a general method for maximizing and minimizing among certain geometric problems. In: SFCS 1979: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 9\u201317. IEEE Computer Society, Los Alamitos (1979)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-004-0520-0","volume":"102","author":"F. Eisenbrand","year":"2005","unstructured":"Eisenbrand, F., Laue, S.: A linear algorithm for integer programming in the plane. Math. Program. Ser. A\u00a0102, 249\u2013259 (2005)","journal-title":"Math. Program. Ser. A"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-45535-3_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"F. Eisenbrand","year":"2001","unstructured":"Eisenbrand, F., Rote, G.: Fast 2-variable integer programming. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 78\u201389. Springer, Heidelberg (2001)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/11774938_3","volume-title":"Combinatorial Image Analysis","author":"F. Feschet","year":"2006","unstructured":"Feschet, F.: The exact lattice width of planar sets and minimal arithmetical thickness. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol.\u00a04040, pp. 25\u201333. Springer, Heidelberg (2006)"},{"key":"5_CR11","first-page":"1","volume-title":"19th International Conference on Pattern Recognition (ICPR)","author":"F. Feschet","year":"2008","unstructured":"Feschet, F.: The lattice width and quasi-straightness in digital spaces. In: 19th International Conference on Pattern Recognition (ICPR), pp. 1\u20134. IEEE, Los Alamitos (2008)"},{"issue":"5&6","key":"5_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01758852","volume":"8","author":"R. Fleischer","year":"1992","unstructured":"Fleischer, R., Mehlhorn, K., Rote, G., Welzl, E., Yap, C.-K.: Simultaneous inner and outer approximation of shapes. Algorithmica\u00a08(5&6), 365\u2013389 (1992)","journal-title":"Algorithmica"},{"issue":"6","key":"5_CR13","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1137\/S009753979528977X","volume":"28","author":"W. Harvey","year":"1999","unstructured":"Harvey, W.: Computing two-dimensional Integer Hulls. SIAM Journal on Computing\u00a028(6), 2285\u20132299 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/321921.321936","volume":"23","author":"D. Hirschberg","year":"1976","unstructured":"Hirschberg, D., Wong, C.K.: A polynomial-time algorithm for the knapsack problem with two variables. J. Assoc. Comput. Mach.\u00a023, 147\u2013154 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"5_CR15","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1109\/34.6790","volume":"10","author":"M.E. Houle","year":"1988","unstructured":"Houle, M.E., Toussaint, G.T.: Computing the width of a set. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a010(5), 761\u2013765 (1988)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"2\/3","key":"5_CR16","first-page":"121","volume":"17","author":"A. H\u00fcbler","year":"1981","unstructured":"H\u00fcbler, A., Klette, R., Voss, K.: Determination of the convex hull of a finite set of planar points within linear time. Elektronische Informationsverarbeitung und Kybernetik\u00a017(2\/3), 121\u2013139 (1981)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jagm.1996.0059","volume":"21","author":"M. Kaib","year":"1996","unstructured":"Kaib, M., Schn\u00f6rr, C.-P.: The Generalized Gauss Reduction Algorithm. Journal of Algorithms\u00a021(3), 565\u2013578 (1996)","journal-title":"Journal of Algorithms"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/322169.322179","volume":"27","author":"R. Kannan","year":"1980","unstructured":"Kannan, R.: A polynomial algorithm for the two variable integer programming problem. J. Assoc. Comput. Mach.\u00a027, 118\u2013122 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1090\/conm\/210\/02796","volume":"210","author":"G. Lachaud","year":"1998","unstructured":"Lachaud, G.: Klein polygons and geometric diagrams. Contemporary Math.\u00a0210, 365\u2013372 (1998)","journal-title":"Contemporary Math."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1090\/conm\/210\/02797","volume":"210","author":"G. Lachaud","year":"1998","unstructured":"Lachaud, G.: Sails and klein polyhedra. Contemporary Math.\u00a0210, 373\u2013385 (1998)","journal-title":"Contemporary Math."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer Programming with a Fixed Number of Variables. Math. Oper. Research\u00a08, 535\u2013548 (1983)","journal-title":"Math. Oper. Research"},{"issue":"6","key":"5_CR22","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1023\/B:CASA.0000020224.83374.d7","volume":"39","author":"S.I. Lyashko","year":"2003","unstructured":"Lyashko, S.I., Rublev, B.V.: Minimal ellipsoids and maximal simplexes in 3D euclidean space. Cybernetics and Systems Analysis\u00a039(6), 831\u2013834 (2003)","journal-title":"Cybernetics and Systems Analysis"},{"key":"5_CR23","unstructured":"Reveill\u00e8s, J.-P.: G\u00e9om\u00e9trie discr\u00e8te, calcul en nombres entiers et algorithmique. Th\u00e8se d\u2019etat, Universit\u00e9 Louis Pasteur, Strasbourg, France (1991)"},{"issue":"1-2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0304-3975(96)00185-5","volume":"172","author":"G. Rote","year":"1997","unstructured":"Rote, G.: Finding a shortest vector in a two-dimensional lattice modulo m. Theoretical Computer Science\u00a0172(1-2), 303\u2013308 (1997)","journal-title":"Theoretical Computer Science"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1911124","volume":"49","author":"H.E. Scarf","year":"1981","unstructured":"Scarf, H.E.: Production sets with indivisibilities part i and part ii. Econometrica\u00a049, 1\u201332, 395\u2013423 (1981)","journal-title":"Econometrica"},{"key":"5_CR26","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1998)"}],"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-642-04397-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:23:05Z","timestamp":1558524185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04397-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043963","9783642043970"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04397-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}