{"id":"https://openalex.org/W4313442086","doi":"https://doi.org/10.1145/3578574","title":"Lower Bounds for Semialgebraic Range Searching and Stabbing Problems","display_name":"Lower Bounds for Semialgebraic Range Searching and Stabbing Problems","publication_year":2023,"publication_date":"2023-01-03","ids":{"openalex":"https://openalex.org/W4313442086","doi":"https://doi.org/10.1145/3578574"},"language":"en","primary_location":{"id":"doi:10.1145/3578574","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3578574","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035056543","display_name":"Peyman Afshani","orcid":"https://orcid.org/0000-0001-6102-0759"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Peyman Afshani","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043351717","display_name":"Pingan Cheng","orcid":"https://orcid.org/0000-0002-8131-847X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Pingan Cheng","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035056543"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":0.2407,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48137881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"70","issue":"2","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/range","display_name":"Range (aeronautics)","score":0.7009617686271667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5316674709320068},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43192368745803833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3840349018573761},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.35328245162963867},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32718318700790405}],"concepts":[{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.7009617686271667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5316674709320068},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43192368745803833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3840349018573761},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.35328245162963867},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32718318700790405},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3578574","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3578574","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/846edb59-d509-4bcf-a235-40ddd4fce95a","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/846edb59-d509-4bcf-a235-40ddd4fce95a","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Afshani, P & Cheng, P 2023, 'Lower Bounds for Semialgebraic Range Searching and Stabbing Problems', Journal of the ACM, vol. 70, no. 2, 16, pp. 1-26. https://doi.org/10.1145/3578574","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1862680590","https://openalex.org/W1997424790","https://openalex.org/W2005411543","https://openalex.org/W2006673860","https://openalex.org/W2025809050","https://openalex.org/W2027387410","https://openalex.org/W2050459520","https://openalex.org/W2053418598","https://openalex.org/W2055721472","https://openalex.org/W2059155916","https://openalex.org/W2067631433","https://openalex.org/W2087040128","https://openalex.org/W2093120238","https://openalex.org/W2099755197","https://openalex.org/W2100503751","https://openalex.org/W2101788557","https://openalex.org/W2149693294","https://openalex.org/W2568603896","https://openalex.org/W2762290866","https://openalex.org/W3103597139","https://openalex.org/W4231235429","https://openalex.org/W4244897565","https://openalex.org/W4251391716","https://openalex.org/W4252217479","https://openalex.org/W4253015087","https://openalex.org/W4315779774"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"In":[0,99,283,391],"the":[1,23,43,46,55,61,82,159,166,188,194,212,235,263,287,291,331,376,419],"semialgebraic":[2,38,150,218,378,382,430],"range":[3,30,47,219,383,431],"searching":[4,220,384],"problem,":[5],"we":[6,19,206,227,244,285,337,344,365,393,433],"are":[7,57,156,328,448],"given":[8,329],"a":[9,33,241,297,315,334,346],"set":[10],"of":[11,35,59,289,293,318,350,381],"n":[12,95,113,133,140,176,252],"points":[13,24,44,236,295],"in":[14,296,396,456],"\u211d":[15],"d":[16,115,134],",":[17,122,275,308,324,326,357,364],"and":[18,72,88,125,179,221,321,385],"want":[20],"to":[21,32,94,427],"preprocess":[22],"such":[25],"that":[26,106,129,187,229,243,336,360,395,402,415],"for":[27,148,193,217,233,272,361,389,438,451],"any":[28,230,399],"query":[29,75,118,142,181,254,332,412],"belonging":[31],"family":[34],"constant":[36],"complexity":[37],"sets":[39],"(Tarski":[40],"cells),":[41],"all":[42],"intersecting":[45],"can":[48,66],"be":[49,67,191,281],"reported":[50],"or":[51],"counted":[52],"efficiently.":[53],"When":[54],"ranges":[56],"composed":[58],"simplices,":[60],"problem":[62,201,242,288,335],"is":[63,91,314],"well-understood:":[64],"It":[65,183],"solved":[68],"using":[69],"S(n)":[70],"space":[71,109,136,178,279,347],"with":[73,77,110,137,173,249],"Q(n)":[74],"time":[76,119,143,255],"\\(S(n)Q(n)^d":[78],"=":[79],"\\tilde{O}(n^d),\\)":[80],"where":[81,262,309],"\\(\\tilde{O}(\\cdot)\\)":[83],"notation":[84,267],"hides":[85,268],"polylogarithmic":[86],"factors":[87],"this":[89,199,208,416,457],"trade-off":[90,168],"tight":[92,450],"(up":[93],"o":[96],"(1)":[97],"factors).":[98],"particular,":[100,392],"there":[101],"exist":[102],"\u201clow":[103,153],"space\u201d":[104,154],"structures":[105,128,455],"use":[107,130,257,367,409],"O(n)":[108],"O":[111,131,138,174],"(":[112,132,175,251],"1-1/":[114],"}":[116],")":[117,135,141,177,253],"[":[120,144,162],"8":[121],"25":[123],"]":[124,164],"\u201cfast":[126,195],"query\u201d":[127,196],"(log":[139],"9":[145],"].":[146],"However,":[147],"general":[149,439],"ranges,":[151],"only":[152],"solutions":[155,161],"known,":[157],"but":[158,198],"best":[160],"7":[163],"match":[165],"same":[167,189],"curve":[169],"as":[170],"simplex":[171],"queries,":[172],"\\(\\tilde{O}(n^{1-1/d})\\)":[180],"time.":[182,413],"has":[184,202],"been":[185],"conjectured":[186],"could":[190],"done":[192],"case,":[197],"open":[200],"stayed":[203],"unresolved.":[204],"Here,":[205],"disprove":[207],"conjecture.":[209],"We":[210,373],"give":[211],"first":[213],"nontrivial":[214],"lower":[215,348,387,436,446],"bounds":[216,388,437,447],"other":[222],"related":[223],"problems.":[224,443],"More":[225],"precisely,":[226],"show":[228,345,394],"data":[231,400,454],"structure":[232,401],"reporting":[234,290],"between":[237],"two":[238],"concentric":[239],"circles,":[240],"call":[245,338],"2D":[246,404,425],"annulus":[247,405],"reporting,":[248],"Q":[250],"must":[256,280,366,408],"\\(S(n)=\\overset{\\scriptscriptstyle":[258],"o}{\\Omega":[259,265,277,352,369],"}(n^3/Q(n)^5)\\)":[260],"space,":[261,398],"\\(\\overset{\\scriptscriptstyle":[264,276,351,368],"}(\\cdot)\\)":[266],"\\(n^{o(1)}\\)":[269],"factors,":[270],"meaning,":[271],"\\(Q(n)=\\log":[273,362],"^{O(1)}n\\)":[274,363],"}(n^3)\\)":[278],"used.":[282],"addition,":[284],"study":[286],"subset":[292],"input":[294],"polynomial":[298,317,339,440],"slab":[299,340,441],"defined":[300],"by":[301,423],"\\(\\lbrace":[302],"(x,y)\\in":[303],"\\mathbb":[304],"{R}^2:P(x)\\le":[305],"y\\le":[306],"P(x)+w\\rbrace\\)":[307],"\\(P(x)=\\sum":[310],"_{i=0}^\\Delta":[311],"a_i":[312],"x^i\\)":[313],"univariate":[316],"degree":[319],"\u0394":[320],"\\(a_0,":[322],"\\ldots":[323],"a_\\Delta":[325],"w\\)":[327],"at":[330],"time,":[333],"reporting.":[341],"For":[342],"this,":[343],"bound":[349,421],"}(n^{\\Delta":[353,370],"+1}/Q(n)^{(\\Delta":[354],"+3)\\Delta":[355],"/2})\\)":[356],"which":[358],"implies":[359],"+1})\\)":[371],"space.":[372],"also":[374,434],"consider":[375],"dual":[377],"stabbing":[379,406,442],"problems":[380,407],"present":[386,435],"them.":[390],"linear":[397,452],"solves":[403],"\\(\\Omega":[410],"(n^{2/3})\\)":[411],"Note":[414],"almost":[417,449],"matches":[418],"upper":[420],"obtained":[422],"lifting":[424],"annuli":[426],"3D.":[428],"Like":[429],"searching,":[432],"Again,":[444],"our":[445],"size":[453],"case.":[458]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}