{"id":"https://openalex.org/W2011297770","doi":"https://doi.org/10.1145/6138.6151","title":"Planar point location using persistent search trees","display_name":"Planar point location using persistent search trees","publication_year":1986,"publication_date":"1986-07-01","ids":{"openalex":"https://openalex.org/W2011297770","doi":"https://doi.org/10.1145/6138.6151","mag":"2011297770"},"language":"en","primary_location":{"id":"doi:10.1145/6138.6151","doi":"https://doi.org/10.1145/6138.6151","is_oa":true,"landing_page_url":"https://doi.org/10.1145/6138.6151","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/6138.6151","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","fnege-3","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/6138.6151","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025319181","display_name":"Neil Sarnak","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil Sarnak","raw_affiliation_strings":["IBM T. J. Watson Research Center, Yorktown Heights, NY","IBM -- T. J. Watson Research Center, Yorktown Heights, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM -- T. J. Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert Endre Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768","observed_orcids":["https://orcid.org/0000-0001-7505-5768"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton Univ., Princeton, NJ","Princeton Univ., Princeton , NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton Univ., Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton Univ., Princeton , NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.4174,"has_fulltext":true,"cited_by_count":482,"citation_normalized_percentile":{"value":0.99184339,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"29","issue":"7","first_page":"669","last_page":"679"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.009399999864399433,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/planar-point-location","display_name":"planar point location","score":0.9990000128746033},{"id":"https://openalex.org/keywords/query-time","display_name":"query response time","score":0.5989999771118164},{"id":"https://openalex.org/keywords/dynamic-data-structures","display_name":"dynamic data structures","score":0.5149999856948853}],"concepts":[{"id":"https://openalex.org/C186750021","wikidata":"https://www.wikidata.org/wiki/Q7208210","display_name":"Point location","level":3,"score":0.7886168956756592},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.7421323657035828},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.7234237194061279},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5995714664459229},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5595866441726685},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5423281192779541},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5366138219833374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5197791457176208},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5192908644676208},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5061675906181335},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5033280253410339},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.4975180923938751},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4969327747821808},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.49528685212135315},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4907451868057251},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48019182682037354},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47624874114990234},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.467266708612442},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4580719470977783},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4532509744167328},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.43116429448127747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4230322539806366},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4057294726371765},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.37031811475753784},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.32519903779029846},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.27552396059036255},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15198281407356262},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.10729670524597168},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09559997916221619},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/6138.6151","doi":"https://doi.org/10.1145/6138.6151","is_oa":true,"landing_page_url":"https://doi.org/10.1145/6138.6151","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/6138.6151","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","fnege-3","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.3210","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.3210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/courses/archive/fall07/cos521/handouts/sarnak.pdf","raw_type":"text"},{"id":"pmh:oai:cumincad.architexturez.net:13637","doi":null,"is_oa":false,"landing_page_url":"http://cumincad.architexturez.net//doc/oai-cumincadworks-id-28d8","pdf_url":null,"source":{"id":"https://openalex.org/S7407064271","display_name":"Cumulative Index of Computer Aided Architectural Design","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-38303","doi":null,"is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=&rft.volume=&rft.issue=&rft.date=2001&rft.spage=256&rft.aulast=Arya&rft.aufirst=S.&rft.atitle=Entropy-preserving+cuttings+and+space-efficient+planar+point+location&rft.title=Proceedings+of+the+Annual+ACM-SIAM+Symposium+on+Discrete+Algorithms","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"}],"best_oa_location":{"id":"doi:10.1145/6138.6151","doi":"https://doi.org/10.1145/6138.6151","is_oa":true,"landing_page_url":"https://doi.org/10.1145/6138.6151","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/6138.6151","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","fnege-3","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2011297770.pdf","grobid_xml":"https://content.openalex.org/works/W2011297770.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W10169753","https://openalex.org/W172574161","https://openalex.org/W1489861152","https://openalex.org/W1513400187","https://openalex.org/W1549335217","https://openalex.org/W1655990431","https://openalex.org/W1872114527","https://openalex.org/W1968301997","https://openalex.org/W1971550377","https://openalex.org/W1972027649","https://openalex.org/W1984627834","https://openalex.org/W1987927249","https://openalex.org/W1989714796","https://openalex.org/W2004389974","https://openalex.org/W2010483698","https://openalex.org/W2011933350","https://openalex.org/W2015553450","https://openalex.org/W2017602223","https://openalex.org/W2021615496","https://openalex.org/W2026166434","https://openalex.org/W2029068974","https://openalex.org/W2038643780","https://openalex.org/W2044734157","https://openalex.org/W2067994867","https://openalex.org/W2068027817","https://openalex.org/W2068376033","https://openalex.org/W2069750902","https://openalex.org/W2077180154","https://openalex.org/W2078962764","https://openalex.org/W2122401137","https://openalex.org/W2126876121","https://openalex.org/W2130055503","https://openalex.org/W2132026455","https://openalex.org/W2158218093","https://openalex.org/W2169271351","https://openalex.org/W2752853835","https://openalex.org/W4249533178"],"related_works":["https://openalex.org/W2107381954","https://openalex.org/W2022598760","https://openalex.org/W3109340025","https://openalex.org/W2280371997","https://openalex.org/W2359095153","https://openalex.org/W2132255384","https://openalex.org/W2491277646","https://openalex.org/W2044936698","https://openalex.org/W2011297770","https://openalex.org/W2091741966"],"abstract_inverted_index":{"A":[0,79],"classical":[1],"problem":[2,13,50],"in":[3,51,89,120,125,183],"computational":[4],"geometry":[5],"is":[6,134,139,149,158],"the":[7,21,35,96,100,121,126,140,146],"planar":[8,154],"point":[9,39,155],"location":[10,156],"problem.":[11],"This":[12],"calls":[14],"for":[15],"preprocessing":[16],"a":[17,31,69,108,179],"polygonal":[18],"subdivision":[19],"of":[20,33,47,99,111,143,162,181],"plane":[22],"defined":[23],"by":[24],"n":[25],"line":[26],"segments":[27],"so":[28],"that,":[29],"given":[30],"sequence":[32],"points,":[34],"polygon":[36],"containing":[37],"each":[38],"can":[40,102],"be":[41,104],"determined":[42],"quickly":[43],"on-line.":[44],"Several":[45],"ways":[46],"solving":[48],"this":[49,163],"O(log":[52,71,135],"n)":[53],"query":[54,131],"time":[55,129],"and":[56,118,123,145],"O(n)":[57],"space":[58,147],"are":[59,63],"known,":[60],"but":[61],"they":[62],"all":[64],"rather":[65],"complicated.":[66],"We":[67,106],"propose":[68],"simple":[70],"n)-query-time,":[72],"O(n)-space":[73],"solution,":[74],"using":[75],"persistent":[76,80,109],"search":[77,81,87,113],"trees.":[78],"tree":[82,88,101,114],"differs":[83],"from":[84],"an":[85,92,159,170],"ordinary":[86],"that":[90,115],"after":[91],"insertion":[93],"or":[94,132],"deletion,":[95],"old":[97],"version":[98],"still":[103],"accessed.":[105],"develop":[107],"form":[110],"binary":[112],"supports":[116],"insertions":[117],"deletions":[119],"present":[122],"queries":[124],"past.":[127],"The":[128,166],"per":[130,151],"update":[133],"m),":[136],"where":[137],"m":[138],"total":[141],"number":[142],"updates,":[144],"needed":[148],"O(1)":[150],"update.":[152],"Our":[153],"algorithm":[157],"immediate":[160],"application":[161],"data":[164],"structure.":[165],"structure":[167],"also":[168],"provides":[169],"alternative":[171],"to":[172],"Chazelle's":[173],"\"hive":[174],"graph\"":[175],"structure,":[176],"which":[177],"has":[178],"variety":[180],"applications":[182],"geometric":[184],"retrieval.":[185]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":14}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}