{"id":"https://openalex.org/W7162581541","doi":"https://doi.org/10.4230/lipics.socg.2026.60","title":"Space-Efficient Approximate Spherical Range Counting in High Dimensions","display_name":"Space-Efficient Approximate Spherical Range Counting in High Dimensions","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162581541","doi":"https://doi.org/10.4230/lipics.socg.2026.60"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25867","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.60","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.60/LIPIcs.SoCG.2026.60.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.60/LIPIcs.SoCG.2026.60.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129230957","display_name":"Andreas Kalavas","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kalavas, Andreas","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0009-0004-8931-108X","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073693999","display_name":"Ioannis Psarros","orcid":"https://orcid.org/0000-0002-5079-5003"},"institutions":[{"id":"https://openalex.org/I4210130908","display_name":"Archimedia (Greece)","ror":"https://ror.org/04dxam533","country_code":"GR","type":"company","lineage":["https://openalex.org/I4210130908"]},{"id":"https://openalex.org/I4210156054","display_name":"Athena Research and Innovation Center In Information Communication & Knowledge Technologies","ror":"https://ror.org/0576by029","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210156054"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Psarros, Ioannis","raw_affiliation_strings":["Archimedes, Athena Research Center, Greece"],"raw_orcid":"https://orcid.org/0000-0002-5079-5003","affiliations":[{"raw_affiliation_string":"Archimedes, Athena Research Center, Greece","institution_ids":["https://openalex.org/I4210156054","https://openalex.org/I4210130908"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.87618617,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.6711999773979187,"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.6711999773979187,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.14910000562667847,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.06620000302791595,"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/range-query","display_name":"Range query (database)","score":0.6080999970436096},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5196999907493591},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.515999972820282},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5084999799728394},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4648999869823456},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.44029998779296875},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.41609999537467957},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.3935000002384186},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.3772999942302704}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.676800012588501},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.6080999970436096},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5196999907493591},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.515999972820282},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5084999799728394},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4648999869823456},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41609999537467957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40860000252723694},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3935000002384186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3831999897956848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3806000053882599},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3772999942302704},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.3594000041484833},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C158245278","wikidata":"https://www.wikidata.org/wiki/Q4386982","display_name":"Equidistant","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.3319999873638153},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25867","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.60","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.60/LIPIcs.SoCG.2026.60.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.socg.2026.60","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.60","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25867","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.60","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.60/LIPIcs.SoCG.2026.60.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162581541.pdf","grobid_xml":"https://content.openalex.org/works/W7162581541.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,123,200],"study":[1],"the":[2,53,57,71,83,89,145,152,163,167,174,218],"following":[3],"range":[4],"searching":[5],"problem":[6,72],"in":[7,135,151],"high-dimensional":[8],"Euclidean":[9,65],"spaces:":[10],"given":[11],"a":[12,25,39,45,85,125,206],"finite":[13],"set":[14],"P":[15,22,37,63,150],"\u2282":[16],"\u211d^d,":[17],"where":[18,99,112,142],"each":[19],"p":[20],"\u2208":[21,50],"is":[23,80,116,144,173],"assigned":[24],"weight":[26,59],"w_p,":[27],"and":[28,132,160,190],"radius":[29],"r":[30,67,159],">":[31,114,188],"0,":[32],"we":[33,94],"need":[34],"to":[35,75,82,102,210,217],"preprocess":[36],"into":[38,110],"data":[40,54,126,176,212],"structure":[41,55,127,177],"such":[42],"that":[43,79,193,214],"when":[44],"new":[46],"query":[47,133,164,191,219],"point":[48],"q":[49,106],"\u211d^d":[51],"arrives,":[52],"reports":[56],"cumulative":[58],"of":[60,62,91,147,149,169],"points":[61,100,148],"within":[64],"distance":[66,157],"from":[68,105,162],"q.":[69,165],"Solving":[70],"exactly":[73],"seems":[74],"require":[76],"space":[77,130,180],"usage":[78,181],"exponential":[81],"dimension,":[84],"phenomenon":[86],"known":[87,120],"as":[88],"curse":[90],"dimensionality.":[92],"Thus,":[93],"focus":[95],"on":[96],"approximate":[97],"solutions":[98],"up":[101],"(1+\u03b5)r":[103,161],"away":[104],"may":[107],"be":[108],"taken":[109],"account,":[111],"\u03b5":[113,187],"0":[115],"an":[117],"input":[118],"parameter":[119],"during":[121],"preprocessing.":[122],"build":[124,211],"with":[128,178,205],"near-linear":[129,184],"usage,":[131],"time":[134,192],"n^{1-\u0398(\u03b5\u2074/log(1/\u03b5))}+t_q^\u03f1\u22c5n^{1-\u03f1},":[136],"for":[137,185,196],"some":[138],"\u03f1":[139],"=":[140],"\u0398(\u03b5\u00b2),":[141],"t_q":[143],"number":[146],"ambiguity":[153],"zone,":[154],"i.e.,":[155],"at":[156],"between":[158],"To":[166],"best":[168],"our":[170,202],"knowledge,":[171],"this":[172],"first":[175],"efficient":[179],"(subquadratic":[182],"or":[183],"any":[186,197],"0)":[189],"remains":[194],"sublinear":[195,198],"t_q.":[199],"supplement":[201],"worst-case":[203],"bounds":[204],"query-driven":[207],"preprocessing":[208],"algorithm":[209],"structures":[213],"are":[215],"well-adapted":[216],"distribution.":[220]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-28T00:00:00"}