{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:55:05Z","timestamp":1743112505231,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74180-2_24","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"283-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions"],"prefix":"10.1007","author":[{"given":"Sandip","family":"Das","sequence":"first","affiliation":[]},{"given":"Ayan","family":"Nandy","sequence":"additional","affiliation":[]},{"given":"Swami","family":"Sarvottamananda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-63307-3_60","volume-title":"Algorithms and Data Structures","author":"G Barequet","year":"1997","unstructured":"Barequet, G., Dickerson, M.T., Goodrich, M.T.: Voronoi diagrams for polygon-offset distance functions. In: Dehne, F., Rau-Chaplin, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 200\u2013209. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63307-3_60"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Matousek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Chew, L.P., Drysdale III., R.L.S.: Voronoi diagrams based on convex distance functions. In: O\u2019Rourke, J. (ed.) Proceedings of the First Annual Symposium on Computational Geometry, pp. 235\u2013244. ACM, June 1985","DOI":"10.1145\/323233.323264"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-39817-4_5","volume-title":"Frontiers in Algorithmics","author":"S Das","year":"2016","unstructured":"Das, S., Nandy, A., Sarvottamananda, S.: Linear time algorithm for 1-center in $$\\mathfrak{R}^d$$ under convex polyhedral distance function. In: Zhu, D., Bereg, S. (eds.) FAW 2016. LNCS, pp. 41\u201352. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39817-4_5"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-29221-2_11","volume-title":"Algorithms and Discrete Applied Mathematics","author":"S Das","year":"2016","unstructured":"Das, S., Nandy, A., Sarvottamananda, S.: Linear time algorithms for euclidean 1-center in $$\\mathfrak{R}^d$$ with non-linear convex constraints. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 126\u2013138. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29221-2_11"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E.: On a multidimensional search technique and its application to the Euclidean one-centre problem. SIAM J. Comput. 15(3), 725\u2013738 (1986)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $$\\Re ^3$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","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. J. ACM 31(1), 114\u2013127 (1984)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:51:59Z","timestamp":1709826719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}