{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:53:48Z","timestamp":1752231228045},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,11]]},"DOI":"10.1016\/0020-0190(89)90155-5","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:05:40Z","timestamp":1034085940000},"page":"59-62","source":"Crossref","is-referenced-by-count":24,"title":["Lower bounds for line stabbing"],"prefix":"10.1016","volume":"33","author":[{"given":"D.","family":"Avis","sequence":"first","affiliation":[]},{"given":"J.M.","family":"Robert","sequence":"additional","affiliation":[]},{"given":"R.","family":"Wenger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90155-5_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\/0020-0190(89)90155-5_BIB2","doi-asserted-by":"crossref","unstructured":"D. Avis and M. Doskas, Algorithms for high dimensional stabbing problems, Discr. Math., to appear.","DOI":"10.1007\/978-3-642-83539-1_7"},{"key":"10.1016\/0020-0190(89)90155-5_BIB3","first-page":"300","article-title":"Algorithms for line stabbers in space","author":"Avis","year":"1987","journal-title":"Proc. 3rd ACM Conference on Computational Geometry"},{"key":"10.1016\/0020-0190(89)90155-5_BIB4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","article-title":"Linear time algorithms for two- and three-variable linear programs","volume":"13","author":"Dyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90155-5_BIB5","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\/0020-0190(89)90155-5_BIB6","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0020-0190(89)90155-5_BIB7","series-title":"Report No. UIUCDCS-R087-1390","article-title":"The upper envelope of piecewise linear functions: algorithms and applications","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0020-0190(89)90155-5_BIB8","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934440","article-title":"Stabbing line segments","volume":"22","author":"Edelsbrunner","year":"1982","journal-title":"BIT"},{"key":"10.1016\/0020-0190(89)90155-5_BIB9","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/73833.73873","article-title":"Stabbing pairwise disjoint translates in linear time","author":"Egyed","year":"1989","journal-title":"Proc. 5th Annual Symposium on Computational Geometry"},{"key":"10.1016\/0020-0190(89)90155-5_BIB10","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF01898631","article-title":"On common transversals","volume":"9","author":"Gr\u00fcnbaum","year":"1958","journal-title":"Arch. Math."},{"issue":"2","key":"10.1016\/0020-0190(89)90155-5_BIB11","article-title":"Hadwiger's transversal theorem in higher dimensions","volume":"1","author":"Goodman","year":"1988","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(89)90155-5_BIB12","series-title":"Combinatorial Geometry in the Plane","author":"Hadwiger","year":"1964"},{"key":"10.1016\/0020-0190(89)90155-5_BIB13","unstructured":"J. Hershberger, Finding the upper envelope of n line segments in O(n log n) time, Manuscript."},{"key":"10.1016\/0020-0190(89)90155-5_BIB14","first-page":"362","article-title":"Skewed projections with an application to line stabbing in R3","author":"Jaromczyk","year":"1988","journal-title":"Proc. 4th ACM Conference on Computational Geometry"},{"issue":"2","key":"10.1016\/0020-0190(89)90155-5_BIB15","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. Geometry"},{"key":"10.1016\/0020-0190(89)90155-5_BIB16","doi-asserted-by":"crossref","first-page":"192","DOI":"10.7146\/math.scand.a-12161","article-title":"A conjecture of Gr\u00fcnbaum on common transversals","volume":"59","author":"Katchalsi","year":"1986","journal-title":"Math. Scand."},{"key":"10.1016\/0020-0190(89)90155-5_BIB17","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":"Discr. Comput. Geometry"},{"key":"10.1016\/0020-0190(89)90155-5_BIB18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(87)90057-4","article-title":"Geometric permutations of disjoint translates of convex sets","volume":"65","author":"Katchalski","year":"1987","journal-title":"Discr. Math."},{"key":"10.1016\/0020-0190(89)90155-5_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":"Discr. Math."},{"key":"10.1016\/0020-0190(89)90155-5_BIB20","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF00181561","article-title":"Two counterexamples concerning transversals for convex subsets of the plane","volume":"9","author":"Lewis","year":"1980","journal-title":"Geometriae Dedicata"},{"key":"10.1016\/0020-0190(89)90155-5_BIB21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01840442","article-title":"Geometric complexity of some location problems","volume":"1","author":"Lee","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(89)90155-5_BIB22","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90155-5_BIB23","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\/0020-0190(89)90155-5_BIB24","first-page":"371","article-title":"Arrangements of lines in 3-space: a data structure with applications","author":"McKenna","year":"1988","journal-title":"Proc. 4th ACM Conference on Computational Geometry"},{"key":"10.1016\/0020-0190(89)90155-5_BIB25","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1145\/358746.358758","article-title":"An on-line algorithm for fitting straight lines between data ranges","volume":"24","author":"O'Rourke","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(89)90155-5_BIB26","first-page":"152","article-title":"Necessary and sufficient conditions for hyperplane transversals","author":"Pollack","year":"1989","journal-title":"Proc. 5th ACM Conference on Computational Geometry"},{"key":"10.1016\/0020-0190(89)90155-5_BIB27","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(89)90155-5_BIB28","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(87)90141-4","article-title":"Obtaining lower bounds using artificial components","volume":"24","author":"Ramanan","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90155-5_BIB29","series-title":"Tech. Report","article-title":"\u03c9(n log n) lower bound for computing the width of a planar point set","author":"Ramanan","year":"1988"},{"key":"10.1016\/0020-0190(89)90155-5_BIB30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02187722","article-title":"Proof of Gr\u00fcnbaum's conjecture on common transversals for translates","volume":"4","author":"Tverberg","year":"1989","journal-title":"Discr. Comput. Geometry"},{"key":"10.1016\/0020-0190(89)90155-5_BIB31","doi-asserted-by":"crossref","unstructured":"R. Wenger, A generalization of Hadwiger's theorem to intersecting sets, Discr. Comput. Geometry, to appear.","DOI":"10.1007\/BF02187799"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901555?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901555?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:23:28Z","timestamp":1554906208000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089901555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0020019089901555"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90155-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}