{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:20:33Z","timestamp":1752229233985},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90127-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"39-48","source":"Crossref","is-referenced-by-count":10,"title":["Algorithms for high dimensional stabbing problems"],"prefix":"10.1016","volume":"27","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[]},{"given":"Mike","family":"Doskas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90127-X_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(87)90226-2","article-title":"Efficient algorithms for common transversals","volume":"25","author":"Atallah","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90127-X_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02187699","article-title":"Diameter partitioning","volume":"1","author":"Avis","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(90)90127-X_BIB3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF02187911","article-title":"Polyhedral line transversals in space","volume":"3","author":"Avis","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(90)90127-X_BIB4","series-title":"Proceedings of Symposia in Pure Mathematics","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1090\/pspum\/007\/0157289","article-title":"Helly's theorem and its relatives","author":"Danzer","year":"1963"},{"key":"10.1016\/0166-218X(90)90127-X_BIB5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0205015","article-title":"Multidimensional search problems","volume":"5","author":"Dobkin","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90127-X_BIB6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","article-title":"Linear programs for two- and three-variable linear programs","volume":"13","author":"Dyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90127-X_BIB7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(85)90005-2","article-title":"Finding transversals for sets of simple geometric figures","volume":"35","author":"Edelsbrunner","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(90)90127-X_BIB8","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0166-218X(90)90127-X_BIB9","series-title":"Algorithms and applications","article-title":"The upper envelope of piecewise linear functions","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0166-218X(90)90127-X_BIB10","first-page":"274","volume":"22","author":"Edelsbrunner","year":"1982","journal-title":"Stabbing line segments"},{"key":"10.1016\/0166-218X(90)90127-X_BIB11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","article-title":"Constructing arrangements of lines and hyperplanes with applications","volume":"15","author":"Edelsbrunner","year":"1986","journal-title":"SIAM J. Comput. Sci."},{"key":"10.1016\/0166-218X(90)90127-X_BIB12","unstructured":"H. Edelsbrunner and M. Sharir, The maximum number of ways to stab n convex non-intersecting objects in the plane is 2n- 2, Discrete Comput. Geom. (to appear)."},{"key":"10.1016\/0166-218X(90)90127-X_BIB13","article-title":"Efficient algorithms for inserting and deleting edges from triangulations","author":"ElGindy","year":"1985","journal-title":"Proceedings International Conference on Foundations of Data Organization"},{"key":"10.1016\/0166-218X(90)90127-X_BIB14","doi-asserted-by":"crossref","unstructured":"J.E. Goodman and R. Pollack, Hadwiger's transversal theorem in higher dimensions, J. Amer. Math. Soc. (to appear).","DOI":"10.2307\/1990918"},{"key":"10.1016\/0166-218X(90)90127-X_BIB15","series-title":"Combinatorial Geometry in the Plane","author":"Hadwiger","year":"1964"},{"key":"10.1016\/0166-218X(90)90127-X_BIB16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF01918521","article-title":"Thin sets and common transversals","volume":"14","author":"Katchalski","year":"1980","journal-title":"J. Geom."},{"key":"10.1016\/0166-218X(90)90127-X_BIB17","doi-asserted-by":"crossref","first-page":"192","DOI":"10.7146\/math.scand.a-12161","article-title":"On a conjecture of Gr\u00fcnbaum on common transversals","volume":"59","author":"Katchalski","year":"1986","journal-title":"Math. Scand."},{"key":"10.1016\/0166-218X(90)90127-X_BIB18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02187708","article-title":"Geometric permutations and common transversals","volume":"1","author":"Katchalski","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(90)90127-X_BIB19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0012-365X(85)90111-6","article-title":"Geometric permutations for convex sets","volume":"54","author":"Katchalski","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(90)90127-X_BIB20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90127-X_BIB21","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90127-X_BIB22","series-title":"Rept. 81-14.","article-title":"A convex hull algorithm optimal for point sets in even dimensions","author":"Seidel","year":"1981"},{"key":"10.1016\/0166-218X(90)90127-X_BIB23","series-title":"Convexity and Optimization in Finite Dimensions I","author":"Stoer","year":"1970"},{"key":"10.1016\/0166-218X(90)90127-X_BIB24","unstructured":"R. Wengec, Upper bounds on geometric permutations, Discrete Comput. Geom. (to appear)."},{"key":"10.1016\/0166-218X(90)90127-X_BIB25","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1137\/0114068","article-title":"Partitions of N space by hyperplanes","volume":"14","author":"Winder","year":"1966","journal-title":"SIAM J. Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090127X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090127X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:56:59Z","timestamp":1555135019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090127X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090127X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90127-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}