{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:21Z","timestamp":1725663441086},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562870"},{"type":"electronic","value":"9783540475071"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56287-7_97","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:02:25Z","timestamp":1330254145000},"page":"92-103","source":"Crossref","is-referenced-by-count":0,"title":["An optimal algorithm for the intersection radius of a set of convex polygons"],"prefix":"10.1007","author":[{"given":"Shreesh","family":"Jadhav","sequence":"first","affiliation":[]},{"given":"Asish","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"Binay","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"B. K. Bhattacharya, J. Czyzowicz, P. Egyed, G. Toussaint, I. Stojmenovic, and J. Urrutia. Computing shortest transversals of set. In Proc. of the Seventh Annual ACM Symp. on Computational Geometry, pages 71\u201380, 1991.","DOI":"10.1145\/109648.109656"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"B. K. Bhattacharya, S. Jadhav, A. Mukhopadhyay, and J. M. Robert. Optimal algorithms for some smallest intersection radius problems. In Proc. of the Seventh Annual ACM Symp. on Computational Geometry, pages 81\u201388, 1991.","DOI":"10.1145\/109648.109657"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1017\/S0013091500037238","volume":"3","author":"G. Chrystal","year":"1885","unstructured":"G. Chrystal. On the problem to construct the minimum circle enclosing n given points in the plane. In Proc. Edinberg Math. Soc, volume 3, pages 30\u201333, 1885.","journal-title":"Proc. Edinberg Math. Soc"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"M. E. Dyer","year":"1986","unstructured":"M. E. Dyer. On a multidimensional search technique and its application to the Euclidean 1-center problem. SLAM J. Computing, 15:725\u2013738, 1986.","journal-title":"SLAM J. Computing"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich and J. S. Snoeyink. Stabbing parallel segments with a convex polygon. In F. Dehne, J.R.Sack, and N. Santaroo, editors, Procs. of the Workshop on Algorithms and Data Structures, pages 231\u2013242. Lecture notes in Computer Science 382, Springer Verlag, 1989.","DOI":"10.1007\/3-540-51542-9_21"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"M. E. Houle, H. Imai, K. Imai, and J. M. Robert. Weighted orthogonal linear L \u221e -approximation and applications. In F. Dehne, J.R.Sack, and N. Santaroo, editors, Procs. of the Workshop on Algorithms and Data Structures, pages 183\u2013191. Lecture notes in Computer Science 382, Springer Verlag, 1989.","DOI":"10.1007\/3-540-51542-9_16"},{"key":"6_CR7","unstructured":"C. Kumar and A. Mukhopadhyay. Minimum area convex polygon stabber of parallel line segments. Manuscript in preparation, 1991."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Linear-time algorithms for linear programming in R 3 and related problems. SIAM J. Computing, 12:759\u2013776, 1983.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"N. Megiddo. Linear programming in linear time when the dimension is fixed. JACM, 31(1):114\u2013127, 1984.","journal-title":"JACM"},{"key":"6_CR10","volume-title":"Technical Report CISC 90-279","author":"H. Meijer","year":"1990","unstructured":"H. Meijer and D. Rappaport. Minimum polygon covers of parallel line segments. Technical Report CISC 90-279, Queen's University, Canada, 1990."},{"key":"6_CR11","first-page":"79","volume":"1","author":"J. J. Sylvester","year":"1857","unstructured":"J. J. Sylvester. A question in the geometry situation. Quart. J. Pure Appl. Math., 1:79, 1857.","journal-title":"Quart. J. Pure Appl. Math."},{"key":"6_CR12","first-page":"203","volume":"20","author":"J. J. Sylvester","year":"1860","unstructured":"J. J. Sylvester. On Poncelet's approximate linear valuation of the surd forms. Philosophical Magazine, 20:203\u2013222, 1860.","journal-title":"Philosophical Magazine"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56287-7_97.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:18Z","timestamp":1605646998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56287-7_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562870","9783540475071"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56287-7_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}