{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:59:51Z","timestamp":1775055591402,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf02246508","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:27:57Z","timestamp":1132018077000},"page":"269-279","source":"Crossref","is-referenced-by-count":5,"title":["Optimal algorithms for some intersection radius problems","Optimale Algorithmen f\u00fcr den Durchschnitts-Radius"],"prefix":"10.1007","volume":"52","author":[{"given":"B. K.","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"S.","family":"Jadhav","sequence":"additional","affiliation":[]},{"given":"A.","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"J. -M.","family":"Robert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02246508_CR1","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B. K., Czyzowicz, J., Egyed, P., Toussaint, G., Stojmenovic, I., Urrutia, J.: Computing shortest transversals of set. In: Proc. of the Seventh Annual ACM Symp. on Computational Geometry, pp. 71\u201380, 1991.","DOI":"10.1145\/109648.109656"},{"key":"BF02246508_CR2","series-title":"Technical Report CMU-CS-78-129","volume-title":"Fast intersection of half spaces","author":"K. Q. Brown","year":"1978","unstructured":"Brown K. Q.: Fast intersection of half spaces. Technical Report CMU-CS-78-129, Carnegie Mellon University, Pittsburg, 1978."},{"key":"BF02246508_CR3","unstructured":"Bhattacharya, B. K., Toussaint, G. T.: Computing shortest transversals. Technical Report SOCS 90.6, McGill University, April 1990."},{"key":"BF02246508_CR4","unstructured":"Chrystal, G.: On the problem to construct the minimum circle enclosingn given points in the plane. In: Proc. Edinberg Math. Soc.,3, 30\u201333 (1885)."},{"key":"BF02246508_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(86)90037-2","volume":"22","author":"K. L. Clarkson","year":"1986","unstructured":"Clarkson, K. L.: Linear programming inO(3(k+1) 2) time. Informa. Proc. Lett.22, 21\u201324 (1986).","journal-title":"Informa. Proc. Lett."},{"key":"BF02246508_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"M. E. Dyer","year":"1984","unstructured":"Dyer, M. E.: Linear-time algorithm for two- and three-variable linear programs. SIAM J. Computing13, 31\u201345 (1984).","journal-title":"SIAM J. Computing"},{"key":"BF02246508_CR7","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"M. E. Dyer","year":"1986","unstructured":"Dyer, M. E.: On a multidimensional search technique and its application to the Euclidean 1-center problem. SIAM J. Computing15, 725\u2013738 (1986).","journal-title":"SIAM J. Computing"},{"key":"BF02246508_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/3-540-51542-9_21","volume-title":"Proc. of the Workshop on Algorithms and Data Structures","author":"M. T. Goodrich","year":"1989","unstructured":"Goodrich, M. T., Snoeyink, J. S.: Stabbing parallel segments with a convex polygon. In: Dehne, F., Sack, J. R., Santaroo, N. (eds) Proc. of the Workshop on Algorithms and Data Structures, pp. 231\u2013242. Berlin Heidelberg New York Tokyo: Springer 1989 (Lecture Notes in Computer Science vol. 382)."},{"key":"BF02246508_CR9","volume-title":"Combinatorial geometry in the plane","author":"H. Hadwiger","year":"1964","unstructured":"Hadwiger, H., Debrunner, H., Klee, V.: Combinatorial geometry in the plane. Toronto: Holt, Rinehart and Winston, 1964."},{"key":"BF02246508_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-51542-9_16","volume-title":"Proc. of the Workshop on Algorithms and Data Structures","author":"M. E. Houle","year":"1989","unstructured":"Houle, M. E., Imai, H., Imai, K., Robert, J. M.: Weighted orthogonal linearL \u221e-approximation and applications. In: Dehne, F., Sack, J. R., Santaroo, N. (eds) Proc. of the Workshop on Algorithms and Data Structures, pp. 183\u2013191. Berlin Heidelberg New York Tokyo: Springer 1989 (Lecture Notes in Computer Science, vol. 382)."},{"key":"BF02246508_CR11","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linar programming inR 3 and related problems. SIAM J. Computing12, 759\u2013776 (1983).","journal-title":"SIAM J. Computing"},{"key":"BF02246508_CR12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. JACM31, 114\u2013127 (1984).","journal-title":"JACM"},{"key":"BF02246508_CR13","series-title":"Technical Report CISC 90-279","volume-title":"Minimum polygon covers of parallel line segments","author":"H. Meijer","year":"1990","unstructured":"Meijer, H., Rappaport, D.: Minimum polygon covers of parallel line segments. Technical Report CISC 90-279, Queen's University, Canada, 1990."},{"key":"BF02246508_CR14","doi-asserted-by":"crossref","unstructured":"Seidel, R.: Linear programming and convex hull made easy. In: Proc. of the Sixth Annual ACM Symp. on Computational Geometry, pp. 211\u2013215, 1990.","DOI":"10.1145\/98524.98570"},{"key":"BF02246508_CR15","unstructured":"Shamos, M. I.: Computational Geometry. PhD thesis, Department of Computer Science, 1978."},{"key":"BF02246508_CR16","first-page":"79","volume":"1","author":"J. J. Sylvester","year":"1857","unstructured":"Sylvester, J. J.: A question in the geometry situation. Q. J. Pure Appl. Math.1, 79 (1857).","journal-title":"Q. J. Pure Appl. Math."},{"key":"BF02246508_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/14786446008642934","volume":"20","author":"J. J. Sylvester","year":"1860","unstructured":"Sylvester, J. J.: On Poncelet's approximate linear valuation of the surd forms. Phil. Mag.20, 203\u2013222 (1860).","journal-title":"Phil. Mag."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02246508.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02246508\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02246508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:30:21Z","timestamp":1558017021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02246508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF02246508"],"URL":"https:\/\/doi.org\/10.1007\/bf02246508","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}