{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T07:49:12Z","timestamp":1713426552185},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1988,9]]},"DOI":"10.1007\/bf02187911","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T08:11:50Z","timestamp":1130573510000},"page":"257-265","source":"Crossref","is-referenced-by-count":19,"title":["Polyhedral line transversals in space"],"prefix":"10.1007","volume":"3","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[]},{"given":"Rephael","family":"Wenger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1988,9,1]]},"reference":[{"key":"BF02187911_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02187699","volume":"1","author":"D. Avis","year":"1986","unstructured":"Avis, D., Diameter Partitioning,Discrete and Computational Geometry, Vol. 1, pp. 265\u2013276, 1986.","journal-title":"Discrete and Computational Geometry"},{"key":"BF02187911_CR2","series-title":"Technical Report","volume-title":"Algorithms for High-Dimensional Stabbing Problems","author":"D. Avis","year":"1987","unstructured":"Avis, D. and Doskas, M., Algorithms for High-Dimensional Stabbing Problems, Technical Report SOCS 87.2, McGill University, Montreal, January 1987."},{"key":"BF02187911_CR3","doi-asserted-by":"crossref","unstructured":"Avis, D. and Wenger, R., Algorithms for Line Stabbers in Space,Proceedings of the 3rd ACM Conference on Computational Geometry, pp. 300\u2013307, Waterloo, 1987.","DOI":"10.1145\/41958.41990"},{"key":"BF02187911_CR4","volume-title":"Multidimensional Analytic Geometry","author":"K. Borsuk","year":"1969","unstructured":"Borsuk, K.,Multidimensional Analytic Geometry, Polish Scientific Publishers, Warsaw, 1969."},{"key":"BF02187911_CR5","first-page":"100","volume-title":"Helly's Theorem and Its Relatives","author":"L. Danzer","year":"1963","unstructured":"Danzer, L., Grunbaum, B., and Klee, V.,Helly's Theorem and Its Relatives, Proceedings of Symposia in Pure Mathematics, pp. 100\u2013181, American Mathematical Society, Providence, RI, 1963."},{"key":"BF02187911_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","volume":"27","author":"D. Dobkin","year":"1983","unstructured":"Dobkin, D. and Kirpatrick, D., Fast Detection of Polyhedral Intersection,Theoretical Computer Science, Vol. 27, pp. 241\u2013253, 1983.","journal-title":"Theoretical Computer Science"},{"key":"BF02187911_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(85)90005-2","volume":"35","author":"H. Edelsbrunner","year":"1985","unstructured":"Edelsbrunner, H., Finding Transversals for Sets of Simple Geometric Figures,Theoretical Computer Science, Vol. 35, pp. 55\u201369, 1985.","journal-title":"Theoretical Computer Science"},{"key":"BF02187911_CR8","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934440","volume":"22","author":"H. Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Maurer, H. A., Preparata, F. P., Rosenberg, A. L., Welzl, E., and Wood, D., Stabbing Line Segments,BIT, Vol. 22, pp. 274\u2013281, 1982.","journal-title":"BIT"},{"key":"BF02187911_CR9","unstructured":"Edelsbrunner, H. and Sharir, M., The Maximum Number of Ways to Stabn Convex Nonintersecting Objects in the Plane is 2n\u20132,Discrete and Computational Geometry, to appear."},{"key":"BF02187911_CR10","unstructured":"ElGindy, H. and Toussaint, G. T., Efficient Algorithms for Inserting and Deleting Edges from Triangulations,Proceedings of the International Conference on Foundations of Data Organization, Kyoto, May 22\u201324, 1985."},{"key":"BF02187911_CR11","doi-asserted-by":"crossref","unstructured":"Goodman, J. E. and Pollack, R., Hadwiger's Transversal Theorem in Higher Dimensions,Journal of the American Mathematical Society, Vol. 1, to appear.","DOI":"10.2307\/1990918"},{"key":"BF02187911_CR12","volume-title":"Combinatorial Geometry in the Plane","author":"H. Hadwiger","year":"1964","unstructured":"Hadwiger, H., Debrunner, H., and Klee, V.,Combinatorial Geometry in the Plane, Holt, Rinehart, and Winston, New York, 1964."},{"key":"BF02187911_CR13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF01918521","volume":"14","author":"M. Katchalski","year":"1980","unstructured":"Katchalski, M., Thin Sets and Common Transversals,Journal of Geometry, Vol. 14, pp. 103\u2013107, 1980.","journal-title":"Journal of Geometry"},{"key":"BF02187911_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0012-365X(85)90111-6","volume":"54","author":"M. Katchalski","year":"1985","unstructured":"Katchalski, M., Lewis, T., and Zaks, J., Geometric Permutations for Convex Sets,Discrete Mathematics, Vol. 54, pp. 271\u2013284, 1985.","journal-title":"Discrete Mathematics"},{"key":"BF02187911_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P. and Shamos, M. I.,Computational Geometry, Springer-Verlag, New York, 1985."},{"key":"BF02187911_CR16","doi-asserted-by":"crossref","unstructured":"Wenger, R., Upper Bounds on Geometric Permutations,Discrete and Computational Geometry, to appear.","DOI":"10.1007\/BF02187777"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187911.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187911\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T15:19:54Z","timestamp":1586531994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["BF02187911"],"URL":"https:\/\/doi.org\/10.1007\/bf02187911","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}