{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:27:38Z","timestamp":1737178058509,"version":"3.33.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":1993,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1016\/j.comgeo.2007.06.001","type":"journal-article","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T13:03:26Z","timestamp":1183035806000},"page":"91-103","source":"Crossref","is-referenced-by-count":1,"title":["Lower bounds for expected-case planar point location"],"prefix":"10.1016","volume":"39","author":[{"given":"Theocharis","family":"Malamatos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2007.06.001_bib001","series-title":"Proc. 7th Scand. Workshop Algorithm Theory","first-page":"353","article-title":"Efficient expected-case algorithms for planar point location","volume":"vol. 1851","author":"Arya","year":"2000"},{"key":"10.1016\/j.comgeo.2007.06.001_bib002","doi-asserted-by":"crossref","unstructured":"S. Arya, T. Malamatos, D.M. Mount, Nearly optimal expected-case planar point location, in: Proc. 41 Annu. IEEE Sympos. Found. Comput. Sci., 2000, pp. 208\u2013218","DOI":"10.1109\/SFCS.2000.892108"},{"key":"10.1016\/j.comgeo.2007.06.001_bib003","unstructured":"S. Arya, T. Malamatos, D.M. Mount, Entropy-preserving cuttings and space efficient planar point location, in: Proc. 12th ACM\u2013SIAM Sympos. Discrete Algorithms, 2001, pp. 256\u2013261"},{"issue":"2","key":"10.1016\/j.comgeo.2007.06.001_bib004","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1240233.1240240","article-title":"A simple entropy-based algorithm for planar point location","volume":"3","author":"Arya","year":"2007","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"10.1016\/j.comgeo.2007.06.001_bib005","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1137\/S0097539704446724","article-title":"Optimal expected-case planar point location","volume":"37","author":"Arya","year":"2007","journal-title":"SIAM J. Comput."},{"year":"2000","series-title":"Computational Geometry: Algorithms and Applications","author":"De Berg","key":"10.1016\/j.comgeo.2007.06.001_bib006"},{"year":"1991","series-title":"Elements of Information Theory","author":"Cover","key":"10.1016\/j.comgeo.2007.06.001_bib007"},{"key":"10.1016\/j.comgeo.2007.06.001_bib008","unstructured":"M.T. Goodrich, M. Orletsky, K. Ramaiyer, Methods for achieving fast query times in point location data structures, in: Proc. 8th ACM\u2013SIAM Sympos. Discrete Algorithms, 1997, pp. 757\u2013766"},{"key":"10.1016\/j.comgeo.2007.06.001_bib009","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.comgeo.2004.03.010","article-title":"Expected asymptotically optimal planar point location","volume":"29","author":"Iacono","year":"2004","journal-title":"Comput. Geom. Theory Appl."},{"year":"1998","series-title":"The Art of Computer Programming, Sorting and Searching, vol. 3","author":"Knuth","key":"10.1016\/j.comgeo.2007.06.001_bib010"},{"key":"10.1016\/j.comgeo.2007.06.001_bib011","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/0206017","article-title":"Best possible bounds on the weighted path length of optimum binary search trees","volume":"6","author":"Mehlhorn","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.comgeo.2007.06.001_bib012","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/jagm.2000.1101","article-title":"On the exact worst case query complexity of planar point location","volume":"37","author":"Seidel","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/j.comgeo.2007.06.001_bib013","series-title":"Handbook of Discrete and Computational Geometry","article-title":"Point location","author":"Snoeyink","year":"2004"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772107000612?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772107000612?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T23:16:45Z","timestamp":1737155805000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772107000612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["S0925772107000612"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2007.06.001","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}