{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:34:49Z","timestamp":1776785689798,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1007\/bf02293050","type":"journal-article","created":{"date-parts":[[2006,2,14]],"date-time":"2006-02-14T12:50:59Z","timestamp":1139921459000},"page":"295-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":372,"title":["A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra"],"prefix":"10.1007","volume":"8","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[]},{"given":"Komei","family":"Fukuda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1992,9,1]]},"reference":[{"key":"BF02293050_CR1","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0121192","volume":"8","author":"D. Avis","year":"1978","unstructured":"D. Avis and V. Chv\u00e1tal, Notes on Bland's Pivoting Rule,Math. Programming Study., vol. 8, pp. 24\u201334, 1978.","journal-title":"Math. Programming Study."},{"key":"BF02293050_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R. G. Bland","year":"1977","unstructured":"R. G. Bland, New Finite Pivoting Rules for the Simplex Method,Math. Oper. Res., vol. 2, pp. 103\u2013107, 1977.","journal-title":"Math. Oper. Res."},{"key":"BF02293050_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/321556.321564","volume":"17","author":"D. R. Chand","year":"1970","unstructured":"D. R. Chand and S. S. Kapur, An Algorithm for Convex Polytopes,J. Assoc. Comput. Mach., vol. 17, pp. 78\u201386, 1970.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02293050_CR4","doi-asserted-by":"crossref","unstructured":"B. Chazelle, An Optimal Convex Hull Algorithm and New Results on Cuttings,Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, pp. 29\u201338, 1991.","DOI":"10.1109\/SFCS.1991.185345"},{"key":"BF02293050_CR5","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal,Linear Programming, Freeman, San Francisco, 1983."},{"key":"BF02293050_CR6","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/moor.8.3.381","volume":"8","author":"M. E. Dyer","year":"1983","unstructured":"M. E. Dyer, The Complexity of Vertex Enumeration Methods,Math. Oper. Res., vol. 8, pp. 381\u2013402, 1983.","journal-title":"Math. Oper. Res."},{"key":"BF02293050_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner,Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987."},{"key":"BF02293050_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"H. Edelsbrunner and L. Guibas, Topologically Sweeping an Arrangement,J. Comput. Syst. Sci., vol. 38, pp. 165\u2013194, 1989.","journal-title":"J. Comput. Syst. Sci."},{"key":"BF02293050_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, J. O'Rourke, and R. Seidel, Constructing Arrangements of Lines and Hyperplanes with Applications,SIAM J. Comput. Sci., vol. 15, pp. 341\u2013363, 1986.","journal-title":"SIAM J. Comput. Sci."},{"key":"BF02293050_CR10","unstructured":"K. Fukuda, Oriented Matroid Programming, Ph.D. Thesis, University of Waterloo, 1982."},{"key":"BF02293050_CR11","unstructured":"K. Fukuda and T. Matsui, On the Finiteness of the Criss-Cross Method,European J. Oper. Res., to appear."},{"key":"BF02293050_CR12","doi-asserted-by":"crossref","unstructured":"M. E. Houle, H. Imai, K. Imai, J.-M. Robert, and P. Yamamoto, Orthogonal Weighted LinearL\n1 andL\n\u221e Approximation and Applications, Manuscript, September 1990.","DOI":"10.1007\/3-540-51542-9_16"},{"key":"BF02293050_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T. H. Mattheiss","year":"1980","unstructured":"T. H. Mattheiss and D. S. Rubin, A Survey and Comparison of Methods for Finding all Vertices of Convex Polyhedral Sets,Math. Oper. Res., vol. 5, pp. 167\u2013185, 1980.","journal-title":"Math. Oper. Res."},{"key":"BF02293050_CR14","series-title":"Annals of Mathematical Studies","volume-title":"The Double Description Method","author":"T. S. Motzkin","year":"1953","unstructured":"T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall,The Double Description Method, Annals of Mathematical Studies, vol. 8, Princeton University Press, Princeton, NJ, 1953."},{"key":"BF02293050_CR15","first-page":"77","volume":"26","author":"K. Paparrizos","year":"1989","unstructured":"K. Paparrizos, Pivoting Rules Directing the Simplex Method Through all Feasible Vertices of Klee-Minty Examples,OPSEARCH, vol. 26, pp. 77\u201395, 1989.","journal-title":"OPSEARCH"},{"key":"BF02293050_CR16","first-page":"26","volume-title":"Degenerate Convex Hulls in High Dimensions Without Extra Storage","author":"G. Rote","year":"1992","unstructured":"G. Rote, Degenerate Convex Hulls in High Dimensions Without Extra Storage,Proc. 8th Annual Symposium on Computational Geometry, ACM Press, New York, pp. 26\u201332, 1992."},{"key":"BF02293050_CR17","unstructured":"R. Seidel, A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions, Report 81-14, Department of Computer Science, University of British Columbia, 1981."},{"key":"BF02293050_CR18","doi-asserted-by":"crossref","unstructured":"R. Seidel, Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face,Proc. 1986 Symposium on the Theory of Computing, pp. 404\u2013413.","DOI":"10.1145\/12130.12172"},{"key":"BF02293050_CR19","first-page":"683","volume":"16","author":"T. Terlaky","year":"1985","unstructured":"T. Terlaky, A Convergent Criss-Cross Method,Math. Operationsforsch. Statist. Ser. Optim., vol. 16, pp. 683\u2013690, 1985.","journal-title":"Math. Operationsforsch. Statist. Ser. Optim."},{"key":"BF02293050_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0095-8956(87)90049-9","volume":"42","author":"T. Terlaky","year":"1987","unstructured":"T. Terlaky, A Finite Criss-Cross Method for Oriented Matroids,J. Combin. Theory Ser. B, vol. 42, pp. 319\u2013327, 1987.","journal-title":"J. Combin. Theory Ser. B"},{"key":"BF02293050_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(85)90042-5","volume":"39","author":"M. Todd","year":"1985","unstructured":"M. Todd, Linear and Quadratic Programming in Oriented Matroids,J. Combin. Theory Ser. B, vol. 39, pp. 105\u2013133, 1985.","journal-title":"J. Combin. Theory Ser. B"},{"key":"BF02293050_CR22","first-page":"1","volume":"8","author":"Z. Wang","year":"1987","unstructured":"Z. Wang, A Conformal Elimination Free Algorithm for Oriented Matroid Programming,Chinese Ann. Math., Ser. B, vol. 8, p. 1, 1987.","journal-title":"Chinese Ann. Math."},{"key":"BF02293050_CR23","unstructured":"D. Avis and K. Fukuda, Reverse Search for Enumeration, Research Report 92-5, GSSM, University of Tsukuba, April 1992."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02293050.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02293050\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02293050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02293050.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T04:03:38Z","timestamp":1713413018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02293050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["BF02293050"],"URL":"https:\/\/doi.org\/10.1007\/bf02293050","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]},"assertion":[{"value":"14 June 1991","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 1992","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 1992","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}