{"id":"https://openalex.org/W3163968926","doi":"https://doi.org/10.1137/21m1423324","title":"Optimal Algorithms for Geometric Centers and Depth","display_name":"Optimal Algorithms for Geometric Centers and Depth","publication_year":2022,"publication_date":"2022-05-19","ids":{"openalex":"https://openalex.org/W3163968926","doi":"https://doi.org/10.1137/21m1423324","mag":"3163968926"},"language":"en","primary_location":{"id":"doi:10.1137/21m1423324","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1423324","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5032955418","display_name":"Timothy M. Chan","orcid":"https://orcid.org/0000-0002-8093-0675"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I71561298","display_name":"Goodwin College","ror":"https://ror.org/009bjed14","country_code":"US","type":"education","lineage":["https://openalex.org/I71561298"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Timothy M. Chan","raw_affiliation_strings":["Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;","institution_ids":["https://openalex.org/I71561298","https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I71561298","display_name":"Goodwin College","ror":"https://ror.org/009bjed14","country_code":"US","type":"education","lineage":["https://openalex.org/I71561298"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sariel Har-Peled","raw_affiliation_strings":["Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;","institution_ids":["https://openalex.org/I71561298","https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012548113","display_name":"Mitchell Jones","orcid":"https://orcid.org/0000-0003-2971-398X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I71561298","display_name":"Goodwin College","ror":"https://ror.org/009bjed14","country_code":"US","type":"education","lineage":["https://openalex.org/I71561298"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mitchell Jones","raw_affiliation_strings":["Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;","institution_ids":["https://openalex.org/I71561298","https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032955418"],"corresponding_institution_ids":["https://openalex.org/I157725225","https://openalex.org/I71561298"],"apc_list":null,"apc_paid":null,"fwci":0.3672,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62481988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"51","issue":"3","first_page":"627","last_page":"663"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/logarithm","display_name":"Logarithm","score":0.6608701348304749},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6001622676849365},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5809291005134583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5789066553115845},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.5787999629974365},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.558225154876709},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5323028564453125},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4980001449584961},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4954756498336792},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47877681255340576},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47504284977912903},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.46995022892951965},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42362892627716064},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41833022236824036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37990397214889526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3039226531982422},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13772305846214294},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08497452735900879}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6608701348304749},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6001622676849365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5809291005134583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5789066553115845},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.5787999629974365},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.558225154876709},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5323028564453125},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4980001449584961},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4954756498336792},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47877681255340576},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47504284977912903},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.46995022892951965},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42362892627716064},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41833022236824036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37990397214889526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3039226531982422},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13772305846214294},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08497452735900879},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1423324","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1423324","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1660609589","display_name":"AF: Small: Towards Sturdier Geometric Algorithms","funder_award_id":"1907400","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G179613736","display_name":"AF:  Small:  Towards better geometric algorithms: Summarizing, partitioning and shrinking data","funder_award_id":"1421231","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4712714692","display_name":null,"funder_award_id":"CCF-1814026","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5511768419","display_name":null,"funder_award_id":"CCF-1907400","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7207409443","display_name":"AF: Small: Fundamental Problems in Geometric Data Structures","funder_award_id":"1814026","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G736274355","display_name":null,"funder_award_id":"CCF-1421231","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":76,"referenced_works":["https://openalex.org/W183253369","https://openalex.org/W596522316","https://openalex.org/W1586905264","https://openalex.org/W1589795514","https://openalex.org/W1789652828","https://openalex.org/W1966950432","https://openalex.org/W1968215127","https://openalex.org/W1972279751","https://openalex.org/W1977946998","https://openalex.org/W1980255024","https://openalex.org/W1984529618","https://openalex.org/W1986084080","https://openalex.org/W1987752344","https://openalex.org/W1990970199","https://openalex.org/W1991306048","https://openalex.org/W1993058867","https://openalex.org/W1994074379","https://openalex.org/W2004900762","https://openalex.org/W2006769458","https://openalex.org/W2008520454","https://openalex.org/W2013382394","https://openalex.org/W2014607560","https://openalex.org/W2017113750","https://openalex.org/W2021751455","https://openalex.org/W2031858761","https://openalex.org/W2034208294","https://openalex.org/W2035006576","https://openalex.org/W2042058097","https://openalex.org/W2050356354","https://openalex.org/W2051690202","https://openalex.org/W2052039890","https://openalex.org/W2054389590","https://openalex.org/W2058432138","https://openalex.org/W2059155916","https://openalex.org/W2060889372","https://openalex.org/W2080052061","https://openalex.org/W2089290774","https://openalex.org/W2097004206","https://openalex.org/W2103893986","https://openalex.org/W2115704441","https://openalex.org/W2134711657","https://openalex.org/W2138237549","https://openalex.org/W2138304862","https://openalex.org/W2144858005","https://openalex.org/W2148269135","https://openalex.org/W2149757010","https://openalex.org/W2149906774","https://openalex.org/W2152479402","https://openalex.org/W2161779238","https://openalex.org/W2166505687","https://openalex.org/W2167816765","https://openalex.org/W2203464362","https://openalex.org/W2282988760","https://openalex.org/W2401032137","https://openalex.org/W2402936881","https://openalex.org/W2469837900","https://openalex.org/W2478857688","https://openalex.org/W2562668005","https://openalex.org/W2588863181","https://openalex.org/W2762051376","https://openalex.org/W2904622460","https://openalex.org/W2912541983","https://openalex.org/W2913321804","https://openalex.org/W2953097648","https://openalex.org/W2962764574","https://openalex.org/W2963964459","https://openalex.org/W3037316797","https://openalex.org/W3098722153","https://openalex.org/W3104060245","https://openalex.org/W3114932062","https://openalex.org/W3125650425","https://openalex.org/W3145128584","https://openalex.org/W4213012742","https://openalex.org/W4246219036","https://openalex.org/W4251391716","https://openalex.org/W4254977685"],"related_works":["https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W3097369619","https://openalex.org/W1994598067","https://openalex.org/W2061496873","https://openalex.org/W2011106535","https://openalex.org/W2963622642","https://openalex.org/W2242793104","https://openalex.org/W2279830512"],"abstract_inverted_index":{"We":[0,46],"develop":[1,74],"a":[2,55,63,81],"general":[3],"randomized":[4],"technique":[5,49],"for":[6,54,76,114,135],"solving":[7],"implicit":[8],"linear":[9,43],"programming":[10],"problems,":[11],"where":[12],"the":[13,30,33,85,88,101,118,138],"collection":[14],"of":[15,25,32,57,68,80,97,127,137],"constraints":[16,36],"are":[17],"defined":[18,35],"implicitly":[19,34],"by":[20],"an":[21],"underlying":[22],"ground":[23],"set":[24,66],"elements.":[26],"In":[27],"many":[28],"cases,":[29],"structure":[31],"can":[37],"be":[38],"used":[39],"to":[40,50],"obtain":[41,51],"faster":[42],"program":[44],"solvers.":[45],"apply":[47],"this":[48],"near-optimal":[52],"algorithms":[53,75,103],"variety":[56],"fundamental":[58],"problems":[59],"in":[60,71,105],"geometry.":[61],"For":[62,99],"given":[64],"point":[65,82],"$P$":[67],"size":[69],"$n$":[70],"$\\mathbb{R}^d$,":[72],"we":[73],"computing":[77],"geometric":[78],"centers":[79],"set,":[83],"including":[84],"centerpoint":[86],"and":[87,91,113],"Tukey":[89],"median,":[90],"several":[92],"other":[93],"more":[94],"involved":[95],"measures":[96],"centrality.":[98],"$d=2$,":[100],"new":[102],"run":[104],"$O(n\\log":[106],"n)$":[107],"expected":[108,119],"time,":[109],"which":[110,129],"is":[111,122,130],"optimal,":[112],"higher":[115],"constant":[116],"$d>2$,":[117],"time":[120],"bound":[121],"within":[123],"one":[124],"logarithmic":[125],"factor":[126],"$O(n^{d-1})$,":[128],"also":[131],"likely":[132],"near":[133],"optimal":[134],"some":[136],"problems.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}