{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:09Z","timestamp":1725560769560},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145520"},{"type":"electronic","value":"9783642145537"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14553-7_30","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T07:59:21Z","timestamp":1280131161000},"page":"316-326","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Algorithms for Planar Convex Hull Problems"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1142\/S0218195905001737","volume":"15","author":"I. Baran","year":"2005","unstructured":"Baran, I., Demaine, E.D.: Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. Internat. J. Comput. Geom. Appl.\u00a015, 327\u2013350 (2005)","journal-title":"Internat. J. Comput. Geom. Appl."},{"unstructured":"Barbay, J., Chen, E.Y.: Convex hull of the union of convex objects in the plane: an adaptive analysis. In: Proc. 20th CCCG, pp. 47\u201351 (2008)","key":"30_CR2"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.tcs.2007.07.015","volume":"387","author":"J. Barbay","year":"2007","unstructured":"Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci.\u00a0387, 284\u2013297 (2007)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Barbay, J., Kenyon: Adaptive intersection and t-threshold problems. In: Proc. 13th SODA, pp. 390\u2013399 (2002)","key":"30_CR4"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Comm. ACM\u00a018, 509\u2013517 (1975)","journal-title":"Comm. ACM"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1972","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci.\u00a07, 448\u2013461 (1972)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.comgeo.2006.03.006","volume":"37","author":"P. Bose","year":"2007","unstructured":"Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Vahrenhold, J.: Space-efficient geometric divide-and-conquer algorithms. Comput. Geom.\u00a037, 209\u2013227 (2007)","journal-title":"Comput. Geom."},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/11523468_47","volume-title":"Automata, Languages and Programming","author":"G.S. Brodal","year":"2005","unstructured":"Brodal, G.S., Fagerberg, R., Moruz, G.: Cache-aware and cache-oblivious adaptive sorting. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 576\u2013588. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Chan, T.M., Chen, E.Y.: Towards in-place geometric algorithms and data structures. In: Proc. 20th SCG, pp. 239\u2013246 (2004)","key":"30_CR9","DOI":"10.1145\/997817.997854"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2003.05.004","volume":"321","author":"H. Br\u00f6nnimann","year":"2004","unstructured":"Br\u00f6nnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G.T.: Space-efficient planar convex hull algorithms. Theor. Comput. Sci.\u00a0321, 25\u201340 (2004)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proc. 11th SODA, pp. 743\u2013752 (2000)","key":"30_CR11"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-45465-9_17","volume-title":"Automata, Languages and Programming","author":"A. Elmasry","year":"2002","unstructured":"Elmasry, A.: Priority queues, pairing, and adaptive sorting. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 183\u2013194. Springer, Heidelberg (2002)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00236-007-0061-0","volume":"45","author":"A. Elmasry","year":"2008","unstructured":"Elmasry, A., Fredman, M.L.: Adaptive sorting: an information theoretic perspective. Acta Inform.\u00a045, 33\u201342 (2008)","journal-title":"Acta Inform."},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-54029-6_153","volume-title":"Advances in Computing and Information - ICCI \u201991","author":"V. Estivill-Castro","year":"1991","unstructured":"Estivill-Castro, V., Wood, D.: Practical adaptive sorting. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol.\u00a0497, pp. 47\u201354. Springer, Heidelberg (1991)"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Comput. Surveys\u00a024, 441\u2013476 (1992)","journal-title":"ACM Comput. Surveys"},{"doi-asserted-by":"crossref","unstructured":"Guibas, L.J., McCreight, E.M., Plass, M.F., Roberts, J.R.: A new representation of linear lists. In: Proc. 9th STOC, pp. 49\u201360 (1977)","key":"30_CR16","DOI":"10.1145\/800105.803395"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF01553901","volume":"4","author":"S. Kapoor","year":"1989","unstructured":"Kapoor, S., Ramanan, P.: Lower bounds for maximal and convex layers problems. Algorithmica\u00a04, 447\u2013459 (1989)","journal-title":"Algorithmica"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0215021","volume":"15","author":"D.G. Kirkpatrick","year":"1986","unstructured":"Kirkpatrick, D.G., Seidel, R.: The ultimate planar convex hull algorithm? SIAM J. Comput.\u00a015, 287\u2013299 (1986)","journal-title":"SIAM J. Comput."},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45471-3_9","volume-title":"Algorithm Theory - SWAT 2002","author":"C. Levcopoulos","year":"2002","unstructured":"Levcopoulos, C., Lingas, A., Mitchell, J.S.B.: Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 80\u201389. Springer, Heidelberg (2002)"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(91)90181-G","volume":"39","author":"C. Levcopoulos","year":"1991","unstructured":"Levcopoulos, C., Petersson, O.: Splitsort\u2014An adaptive sorting algorithm. Infor. Proc. Lett.\u00a039, 205\u2013211 (1991)","journal-title":"Infor. Proc. Lett."},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jagm.1993.1021","volume":"14","author":"C. Levcopoulos","year":"1993","unstructured":"Levcopoulos, C., Petersson, O.: Adaptive Heapsort. J. Algor.\u00a014, 395\u2013413 (1993)","journal-title":"J. Algor."},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/TC.1985.5009382","volume":"34","author":"H. Mannila","year":"1985","unstructured":"Mannila, H.: Measures of presortedness and optimal sorting algorithms. IEEE Trans. Comput.\u00a034, 318\u2013325 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"30_CR23","series-title":"Sorting and Searching","volume-title":"Data Structures and Algorithms","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms. Sorting and Searching, vol.\u00a01. Springer, Heidelberg (1984)"},{"key":"30_CR24","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\u00a031, 114\u2013127 (1984)","journal-title":"J. ACM"},{"key":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-540-30140-0_50","volume-title":"Algorithms \u2013 ESA 2004","author":"A. Pagh","year":"2004","unstructured":"Pagh, A., Pagh, R., Thorup, M.: On adaptive integer sorting. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 556\u2013567. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14553-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:22:32Z","timestamp":1552821752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14553-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145520","9783642145537"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14553-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}