{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:34:53Z","timestamp":1772516093727,"version":"3.50.1"},"reference-count":9,"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":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf02574382","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T12:11:43Z","timestamp":1174565503000},"page":"291-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Computing a centerpoint of a finite planar set of points in linear time"],"prefix":"10.1007","volume":"12","author":[{"given":"S.","family":"Jadhav","sequence":"first","affiliation":[]},{"given":"A.","family":"Mukhopadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1994,9,1]]},"reference":[{"issue":"1","key":"BF02574382_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"R. Cole. Slowing down sorting networks to obtain faster sorting algorithms.J. Assoc. Comput. Mach., 34(1):200\u2013208, 1987.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02574382_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0216005","volume":"16","author":"R. Cole","year":"1987","unstructured":"R. Cole, M. Sharir, and C. Yap. Onk-hulls and related problems.SIAM J. Comput., 16: 61\u201377, 1987.","journal-title":"SIAM J. Comput."},{"key":"BF02574382_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987."},{"key":"BF02574382_CR4","unstructured":"S. Jadhav and A. Mukhopadhyay. Designing optimal geometric algorithms using partial sorting networks. Technical Report TRCS-93-165, Indian Institute of Technology, Kanpur, 1993. Accepted in the Third National Seminar on Theoretical Computer Science, 1993, Kharagpur, India."},{"key":"BF02574382_CR5","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek. Approximations and optimal geometric divide-and-conquer.Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 505\u2013511, 1991.","DOI":"10.1145\/103418.103470"},{"issue":"4","key":"BF02574382_CR6","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 \u211c3 and related problems.SIAM J. Comput., 12(4):759\u2013776, 1983.","journal-title":"SIAM J. Comput."},{"key":"BF02574382_CR7","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/0196-6774(85)90011-2","volume":"3","author":"N. Megiddo","year":"1985","unstructured":"N. Megiddo. Partitioning with two lines in the plane.J. Algorithms, 3:430\u2013433, 1985.","journal-title":"J. Algorithms"},{"key":"BF02574382_CR8","unstructured":"Shang-Hua Teng. Center Points and Graph Separators. Ph.D. thesis, School of Computer Science, Carnegie-Mellon University, 1993."},{"key":"BF02574382_CR9","volume-title":"Convex Figures","author":"I. M. Yaglom","year":"1961","unstructured":"I. M. Yaglom and V. G. Boltyanskii.Convex Figures, Holt, Rinehart and Winston, New York, 1961."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02574382.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02574382\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02574382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02574382.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T05:02:37Z","timestamp":1713502957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02574382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF02574382"],"URL":"https:\/\/doi.org\/10.1007\/bf02574382","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]},"assertion":[{"value":"30 July 1992","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 1994","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 1994","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}