{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:30Z","timestamp":1725489810737},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73951-7_45","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"519-528","source":"Crossref","is-referenced-by-count":2,"title":["On Computing the Centroid of the Vertices of an Arrangement and Related Problems"],"prefix":"10.1007","author":[{"given":"Deepak","family":"Ajwani","sequence":"first","affiliation":[]},{"given":"Saurabh","family":"Ray","sequence":"additional","affiliation":[]},{"given":"Raimund","family":"Seidel","sequence":"additional","affiliation":[]},{"given":"Hans Raj","family":"Tiwary","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"45_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF02189304","volume":"9","author":"P.K. Agarwal","year":"1993","unstructured":"Agarwal, P.K., Sharir, M.: Applications of a new space-partitioning technique. Discrete Comput. Geom.\u00a09(1), 11\u201338 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/PL00009500","volume":"23","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Varadarajan, K.R.: Efficient algorithms for approximating polygonal chains. Discrete Computational Geometry\u00a023, 273\u2013291 (2000)","journal-title":"Discrete Computational Geometry"},{"issue":"2","key":"45_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B. Chazelle","year":"1993","unstructured":"Chazelle, B.: Cutting hyperplanes for divide-and-conquer. Discrete Computational Geometry\u00a09(2), 145\u2013158 (1993)","journal-title":"Discrete Computational Geometry"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R. Cole","year":"1989","unstructured":"Cole, R., Salowe, J., Steiger, W., Szemer\u00e9di, E.: Optimal slope selection. SIAM J. Computing\u00a018, 792\u2013810 (1989)","journal-title":"SIAM J. Computing"},{"key":"45_CR5","volume-title":"Introduction to Algorithms, ch. 32","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, ch. 32, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"45_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications, ch. 5","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, ch. 5. Springer, Heidelberg (1997)"},{"issue":"3","key":"45_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A. Gajentaan","year":"1995","unstructured":"Gajentaan, A., Overmars, M.H.: On a class of \u00f8(n\n 2) problems in computational geometry. Comput. Geom. Theory Appl.\u00a05(3), 165\u2013185 (1995)","journal-title":"Comput. Geom. Theory Appl."},{"key":"45_CR8","unstructured":"Langerman, S., Steiger, W.: Ham-sandwich cuts and other tasks in arrangements, Technical report (2001)"},{"key":"45_CR9","volume-title":"Fundamental problems of algorithmic algebra","author":"C.K. Yap","year":"2000","unstructured":"Yap, C.K.: Fundamental problems of algorithmic algebra. Oxford University Press, New York (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:07:08Z","timestamp":1558487228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540739487","9783540739517"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}