{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T05:21:24Z","timestamp":1775712084327,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0925-7721(96)00023-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"265-301","source":"Crossref","is-referenced-by-count":167,"title":["How good are convex hull algorithms?"],"prefix":"10.1016","volume":"7","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[]},{"given":"David","family":"Bremner","sequence":"additional","affiliation":[]},{"given":"Raimund","family":"Seidel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(96)00023-5_BIB1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF02023098","article-title":"Bounds on the number of vertices of polyhedra","volume":"47","author":"Armand","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB2","series-title":"Proc. 11th Ann. ACM Sympos. Comput. Geom.","first-page":"20","article-title":"How good are convex hull algorithms?","author":"Avis","year":"1995"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB3","article-title":"Solitaire cones","author":"Avis","year":"1996"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","article-title":"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra","volume":"8","author":"Avis","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB5","unstructured":"B. Bradford Barber, D.P. Dobkin and H. Huhdanpaa, The quickhull algorithm for convex hull, ACM Trans. on Mathematical Software, to appear."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB6","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/BF02771563","article-title":"The minimum number of vertices of a simple polytope","volume":"8","author":"Barnette","year":"1971","journal-title":"Israel J. Math."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB7","first-page":"485","article-title":"Combinatorial aspects of convex polytopes","volume":"Vol. A","author":"Bayer","year":"1993"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB8","series-title":"Introduction to Convex Polytopes","author":"Br\u00f8ndsted","year":"1981"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1103\/PhysRevB.49.1","article-title":"Ground states of a ternary lattice model with nearest and next-nearest neighbor interactions","volume":"49","author":"Ceder","year":"1994","journal-title":"Phys. Rev. B"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB10","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/321556.321564","article-title":"An algorithm for convex polytopes","volume":"17","author":"Chand","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB11","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02573985","article-title":"An optimal convex hull algorithm in any fixed dimension","volume":"10","author":"Chazelle","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB12","series-title":"Linear Programming","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB13","series-title":"Proc. 35th IEEE Sympos. Found. Comput. Sci.","first-page":"695","article-title":"More output-sensitive geometric algorithms","author":"Clarkson","year":"1994"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB14","series-title":"Proc. 4th Ann. ACM Sympos. Comput. Geom.","first-page":"12","article-title":"Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental","author":"Clarkson","year":"1988"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB15","series-title":"Technical Report","article-title":"On skeletons, diameters and volumes of metric polyhedra","author":"Deza","year":"1996"},{"issue":"3","key":"10.1016\/S0925-7721(96)00023-5_BIB16","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/moor.8.3.381","article-title":"The complexity of vertex enumeration methods","volume":"8","author":"Dyer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB17","first-page":"147","article-title":"Algorithms in Combinatorial Geometry","volume":"10","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB18","unstructured":"K. Fukuda, cdd Reference Manual, Version 0.55 (EPFL, Lausanne, Switzerland)."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB19","unstructured":"K. Fukuda, mit71-61.ine solved, Private communication (1996)."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02096255","article-title":"Selected bibliography on degeneracy","volume":"47","author":"Gal","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB21","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0195-6698(92)90021-Q","article-title":"Computing extreme rays of the metric cone for seven points","volume":"13","author":"Grishukin","year":"1992","journal-title":"European J. Combinatorics"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB22","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02574690","article-title":"A simple and relatively efficient triangulation of the n-cube","volume":"6","author":"Haiman","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB24","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1098\/rstl.1856.0018","article-title":"On the enumeration of x-hedra having triedal summits and an (x \u2212 1)-gonal base","volume":"146","author":"Kirkman","year":"1856","journal-title":"Philos. Trans. Roy. Soc. London Ser. A"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02392139","article-title":"Polytope pairs and their relationship to linear programming","volume":"133","author":"Klee","year":"1974","journal-title":"Acta Math."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB26","series-title":"Inequalities-III","first-page":"159","article-title":"How good is the simplex method?","author":"Klee","year":"1972"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB27","doi-asserted-by":"crossref","DOI":"10.1145\/62959.62969","article-title":"Efficient and portable combined random number generators","volume":"31","author":"L'Ecuyer","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB28","series-title":"Proc. 8th Ann. ACM Sympos. Comput. Geom.","first-page":"16","article-title":"Linear optimization queries","author":"Matou\u0161ek","year":"1992"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB29","first-page":"179","article-title":"The maximal number of faces of a convex polytope","volume":"17","author":"McMullen","year":"1970","journal-title":"Mathematica"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB30","series-title":"Contributions to the Theory of Games II, Annals of Mathematics Studies","first-page":"51","article-title":"The double description method","author":"Motzkin","year":"1953"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB31","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01582058","article-title":"Efficient enumeration of the vertices of polyhedra associated with network LP's","volume":"63","author":"Provan","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB32","series-title":"Proc. 8th ACM Sympos. Comput. Geom.","first-page":"26","article-title":"Degenerate convex hulls in high dimensions without extra storage","author":"Rote","year":"1992"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB33","doi-asserted-by":"crossref","unstructured":"R. Seidel, The nature and meaning of perturbations in geometric computing, Discrete Comput. Geom., to appear.","DOI":"10.1007\/3-540-57785-8_127"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB34","series-title":"Technical Report","article-title":"A convex hull algorithm optimal for point sets in even dimensions","author":"Seidel","year":"1981"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB35","article-title":"Output-size sensitive algorithms for constructive problems in computational geometry","author":"Seidel","year":"1986"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB36","unstructured":"also: Technical Report TR 86\u2013784."},{"key":"10.1016\/S0925-7721(96)00023-5_BIB37","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0196-6774(85)90017-3","article-title":"Finding the convex hull facet by facet","author":"Swart","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB38","series-title":"Lectures on Polytopes","author":"Ziegler","year":"1994"},{"key":"10.1016\/S0925-7721(96)00023-5_BIB39","series-title":"Proc. ISAAC '96","first-page":"26","article-title":"Incremental convex hull algorithms are not output sensitive","volume":"1178","author":"Bremner","year":"1996"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000235?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000235?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:25:18Z","timestamp":1555197918000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772196000235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":39,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0925772196000235"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(96)00023-5","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}