{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:25:54Z","timestamp":1725521154520},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540895497"},{"type":"electronic","value":"9783540895503"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89550-3_18","type":"book-chapter","created":{"date-parts":[[2008,11,18]],"date-time":"2008-11-18T09:02:28Z","timestamp":1226998948000},"page":"166-177","source":"Crossref","is-referenced-by-count":0,"title":["Divide and Conquer Method for k-Set Polygons"],"prefix":"10.1007","author":[{"given":"Wael","family":"El Oraiby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48447-7_1","volume-title":"Proc. 6th Workshop Algorithms Data Struct.","author":"A. Andrzejak","year":"1999","unstructured":"Andrzejak, A., Fukuda, K.: Optimization over k-set polytopes and efficient k-set enumeration. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 1\u201312. Springer, Heidelberg (1999)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00454-002-2778-4","volume":"29","author":"A. Andrzejak","year":"2003","unstructured":"Andrzejak, A., Welzl, E.: In between k-sets, j-facets, and i-faces: (i,j)-partitions. Discrete Comput. Geom.\u00a029, 105\u2013131 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: Proc. 43rd Annu. Sympos. Found. Comput. Science, pp. 617\u2013626 (2002)","DOI":"10.1109\/SFCS.2002.1181985"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0216005","volume":"16","author":"R. Cole","year":"1987","unstructured":"Cole, R., Sharir, M., Yap, C.K.: On k-hulls and related problems. SIAM J. Comput.\u00a016, 61\u201377 (1987)","journal-title":"SIAM J. Comput."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T.K. Dey","year":"1998","unstructured":"Dey, T.K.: Improved bounds on planar k-sets and related problems. Discrete Comput. Geom.\u00a019, 373\u2013382 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11821069_30","volume-title":"Mathematical Foundations of Computer Science 2006","author":"W. Oraiby El","year":"2006","unstructured":"El Oraiby, W., Schmitt, D.: k-sets of convex inclusion chains of planar point sets. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 339\u2013350. Springer, Heidelberg (2006)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","volume":"2","author":"R.A. Jarvis","year":"1973","unstructured":"Jarvis, R.A.: On the identification of the convex hull of a finite set of points in the plane. Inform. Process. Lett.\u00a02, 18\u201321 (1973)","journal-title":"Inform. Process. Lett."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M.H. Overmars","year":"1981","unstructured":"Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci.\u00a023, 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Toth, G.: Point sets with many k-sets. In: Proc. 16th Annu. ACM Sympos. Comput. Geom, pp. 37\u201342 (2000)","DOI":"10.1145\/336154.336171"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry and Graph Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89550-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T21:20:02Z","timestamp":1551648002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89550-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540895497","9783540895503"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89550-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}