{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T15:40:36Z","timestamp":1771342836036,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1016\/0020-0190(85)90015-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"117-122","source":"Crossref","is-referenced-by-count":66,"title":["The power of geometric duality revisited"],"prefix":"10.1016","volume":"21","author":[{"given":"D.T.","family":"Lee","sequence":"first","affiliation":[]},{"given":"Y.T.","family":"Ching","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(85)90015-8_BIB1_1","series-title":"Proc. IEEE 24th Symp. on Foundations of Computer Science","first-page":"217","article-title":"The power of geometric duality","author":"Chazelle","year":"1983"},{"key":"10.1016\/0020-0190(85)90015-8_BIB1_2","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"Chazelle","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0020-0190(85)90015-8_BIB2","series-title":"Proc. IEEE 24th Symp. on Foundations of Computer Science","first-page":"112","article-title":"Geometric retrieval problems","author":"Cole","year":"1983"},{"key":"10.1016\/0020-0190(85)90015-8_BIB3","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, L.J. Guibas and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput., to appear.","DOI":"10.1137\/0215023"},{"key":"10.1016\/0020-0190(85)90015-8_BIB4","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0020-0190(82)90090-4","article-title":"Polygonal intersection searching","volume":"14","author":"Edelsbrunner","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(85)90015-8_BIB5","series-title":"Proc. IEEE 24th Symp. on Foundations of Computer Science","first-page":"83","article-title":"Constructing arrangements of lines and hyperplanes with applications","author":"Edelsbrunner","year":"1983"},{"key":"10.1016\/0020-0190(85)90015-8_BIB6","series-title":"Tech. Rept. F111","article-title":"Halfplanar range search in linear space and O(n0.695) query time","author":"Edelsbrunner","year":"1983"},{"issue":"3","key":"10.1016\/0020-0190(85)90015-8_BIB7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0212032","article-title":"Multidimensional sorting","volume":"12","author":"Goodman","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(85)90015-8_BIB8","series-title":"Proc. IEEE 24th Symp. on Foundations of Computer Science","first-page":"100","article-title":"A kinetic framework for computational geometry","author":"Guibas","year":"1983"},{"issue":"1","key":"10.1016\/0020-0190(85)90015-8_BIB9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0020-0190(85)90015-8_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0604021","article-title":"Finding least-distances lines","volume":"4","author":"Megiddo","year":"1983","journal-title":"SIAM J. Alg. Disc. Math."},{"key":"10.1016\/0020-0190(85)90015-8_BIB11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0211012","article-title":"Polygon retrieval","volume":"11","author":"Willard","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(85)90015-8_BIB12","series-title":"Proc. 15th Ann. Symp. on Theory of Computing","first-page":"258","article-title":"A 3-space partition and its applications","author":"Yao","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:28:02Z","timestamp":1553592482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0020019085900158"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90015-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}