{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:27:08Z","timestamp":1787340428442,"version":"build-2736575974"},"reference-count":17,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1981,8]]},"abstract":"<jats:p>Given a planar straight line graph G with n vertices and a point $P_0 $, locating $P_0 $ means to find the region of the planar subdivision induced by G which contains $P_0 $. Recently, Lipton and Tarjan presented a brilliant but extremely complex point location algorithm which runs in time $O(\\log n)$ on a data structure using $O(n)$ storage. This paper presents a practical algorithm which runs in less than $6\\lceil {\\log _2 n} \\rceil $ comparisons on a data structure which uses $O(n\\log n)$ storage, in the worst case. The method rests crucially on a simple partition of each edge of G into $O(\\log n)$ segments.<\/jats:p>","DOI":"10.1137\/0210035","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:24:20Z","timestamp":1109226260000},"page":"473-482","source":"Crossref","is-referenced-by-count":78,"title":["A New Approach to Planar Point Location"],"prefix":"10.1137","volume":"10","author":[{"given":"Franco P.","family":"Preparata","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0205015"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"D. T. Lee, F. P. Preparata,  Location of a point in a planar subdivision and its applications,  Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pa., 1976), Assoc. Comput. Mach., New York,  1976,  231\u2013235 55:69360365.68051","DOI":"10.1145\/800113.803653"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0206043"},{"key":"R4","unstructured":"M. I. Shamos,  Computational Geometry,  1977, Dept. of Computer Science, Yale University, Springer-Verlag, to appear"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"R. J. Lipton, R. E. Tarjan,  Applications of a planar separator theorem,  Proc. 18th IEEE Symposium on Foundation of Computer Science, Providence, RI,  1977,  162\u2013170","DOI":"10.1109\/SFCS.1977.6"},{"key":"R6","unstructured":"Richard J. Lipton, Robert E. Tarjan,  A separator theorem for planar graphs,  Proceedings of a Conference on Theoretical Computer Science (Univ. Waterloo, Waterloo, Ont., 1977), Comput. Sci. Dept., Univ. Waterloo, Waterloo, Ont.,  1978,  1\u201310 58:218520417.05023"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90062-5"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90051-8"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90117-0"},{"key":"R10","unstructured":"J. L. Bentley,  Solution to Klee's rectangle problems,  1977, unpublished manuscript, Department of Computer Science, Carnegie-Mellon University, Pittsburgh"},{"key":"R11","volume-title":"Combinatorial algorithms: theory and practice","author":"Reingold Edward M.","year":"1977"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1973.223757"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321973"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90117-0"},{"key":"R15","unstructured":"J. L. Bentley,  Multidimensional divide and conquer, Research Review, Dept. Computer Science, Carnegie-Mellon University,  1977"},{"key":"R16","volume-title":"The art of computer programming. Vol. 1: Fundamental algorithms","author":"Knuth Donald E.","year":"1969"},{"key":"R17","unstructured":"D. G. Kirkpatrick,  Optimal search in planar subdivisions,  1979, manuscript, Dept. Comput Science, University of British Columbia, Vancouver, British Columbia"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0210035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:34:37Z","timestamp":1787337277000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0210035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,8]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,8]]}},"alternative-id":["10.1137\/0210035"],"URL":"https:\/\/doi.org\/10.1137\/0210035","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,8]]}}}