{"id":"https://openalex.org/W4295128493","doi":"https://doi.org/10.1145/3559106","title":"Optimal Bound on the Combinatorial Complexity of Approximating Polytopes","display_name":"Optimal Bound on the Combinatorial Complexity of Approximating Polytopes","publication_year":2022,"publication_date":"2022-09-10","ids":{"openalex":"https://openalex.org/W4295128493","doi":"https://doi.org/10.1145/3559106"},"language":"en","primary_location":{"id":"doi:10.1145/3559106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3559106","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1910.14459","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027776701","display_name":"Rahul Arya","orcid":"https://orcid.org/0000-0003-0650-8991"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rahul Arya","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0003-0650-8991","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022760571","display_name":"Sunil Arya","orcid":"https://orcid.org/0000-0003-0939-4192"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Sunil Arya","raw_affiliation_strings":["Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0003-0939-4192","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013407008","display_name":"Guilherme D. da Fonseca","orcid":"https://orcid.org/0000-0002-9807-028X"},"institutions":[{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I4210114274","display_name":"Laboratoire d\u2019Informatique et Syst\u00e8mes","ror":"https://ror.org/0257sgk90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I143002897","https://openalex.org/I21491767","https://openalex.org/I4210114274"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Guilherme D. da Fonseca","raw_affiliation_strings":["Aix-Marseille Universit\u00e9 and LIS, Marseille cedex 09, France"],"raw_orcid":"https://orcid.org/0000-0002-9807-028X","affiliations":[{"raw_affiliation_string":"Aix-Marseille Universit\u00e9 and LIS, Marseille cedex 09, France","institution_ids":["https://openalex.org/I4210114274","https://openalex.org/I21491767"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016442699","display_name":"David M. Mount","orcid":"https://orcid.org/0000-0002-3290-8932"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Mount","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, USA"],"raw_orcid":"https://orcid.org/0000-0002-3290-8932","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4205,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79816141,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"18","issue":"4","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9988999962806702,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983000159263611,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7842026948928833},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7774677276611328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7652133703231812},{"id":"https://openalex.org/keywords/convex-body","display_name":"Convex body","score":0.6957671642303467},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6254785060882568},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5669710636138916},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5513413548469543},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.5056309700012207},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4895881116390228},{"id":"https://openalex.org/keywords/combinatorial-explosion","display_name":"Combinatorial explosion","score":0.4828398823738098},{"id":"https://openalex.org/keywords/discrete-geometry","display_name":"Discrete geometry","score":0.47495484352111816},{"id":"https://openalex.org/keywords/hausdorff-distance","display_name":"Hausdorff distance","score":0.43953636288642883},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.420034259557724},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36585307121276855},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.3260117471218109},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.2846604883670807},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.15548014640808105},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10359817743301392}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7842026948928833},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7774677276611328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7652133703231812},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.6957671642303467},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6254785060882568},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5669710636138916},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5513413548469543},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.5056309700012207},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4895881116390228},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.4828398823738098},{"id":"https://openalex.org/C4107886","wikidata":"https://www.wikidata.org/wiki/Q906377","display_name":"Discrete geometry","level":2,"score":0.47495484352111816},{"id":"https://openalex.org/C141898687","wikidata":"https://www.wikidata.org/wiki/Q1501997","display_name":"Hausdorff distance","level":2,"score":0.43953636288642883},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.420034259557724},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36585307121276855},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.3260117471218109},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2846604883670807},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.15548014640808105},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10359817743301392},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3559106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3559106","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1910.14459","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.14459","pdf_url":"https://arxiv.org/pdf/1910.14459","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:HAL:hal-04501906v1","is_oa":false,"landing_page_url":"https://amu.hal.science/hal-04501906","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 2022, 18 (4), pp.1-29. ⟨10.1145/3559106⟩","raw_type":"Journal articles"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-123275","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=1549-6325&rft.volume=18&rft.issue=4&rft.date=2022&rft.spage=&rft.aulast=Arya&rft.aufirst=&rft.atitle=Optimal+Bound+on+the+Combinatorial+Complexity+of+Approximating+Polytopes&rft.title=ACM+TRANSACTIONS+ON+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,"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":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1910.14459","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.14459","pdf_url":"https://arxiv.org/pdf/1910.14459","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G4871431719","display_name":"Algorithms for Multi-Dimensional Data via Sketches","funder_award_id":"ANR-19-CE48-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W187211397","https://openalex.org/W1493472025","https://openalex.org/W1547238168","https://openalex.org/W1581442026","https://openalex.org/W1695327443","https://openalex.org/W1967952322","https://openalex.org/W1979306594","https://openalex.org/W1995232397","https://openalex.org/W2006109604","https://openalex.org/W2037318282","https://openalex.org/W2047308801","https://openalex.org/W2049731483","https://openalex.org/W2051658853","https://openalex.org/W2052967435","https://openalex.org/W2083027876","https://openalex.org/W2086591901","https://openalex.org/W2094692117","https://openalex.org/W2137746155","https://openalex.org/W2148642357","https://openalex.org/W2235983888","https://openalex.org/W2274455069","https://openalex.org/W2339690594","https://openalex.org/W2604865451","https://openalex.org/W2606736274","https://openalex.org/W2738786117","https://openalex.org/W2761985283","https://openalex.org/W2903127860","https://openalex.org/W2921474644","https://openalex.org/W2963756047","https://openalex.org/W2964309699","https://openalex.org/W3098209288","https://openalex.org/W3098818037","https://openalex.org/W4210733153","https://openalex.org/W4232718314","https://openalex.org/W4234356172","https://openalex.org/W4244253113","https://openalex.org/W4248139057","https://openalex.org/W4248484045","https://openalex.org/W4249950568"],"related_works":["https://openalex.org/W2321841117","https://openalex.org/W2371177213","https://openalex.org/W1490572398","https://openalex.org/W2402215390","https://openalex.org/W2076059647","https://openalex.org/W2011497805","https://openalex.org/W2038488337","https://openalex.org/W1995892550","https://openalex.org/W4287864192","https://openalex.org/W4295128493"],"abstract_inverted_index":{"This":[0],"article":[1],"considers":[2],"the":[3,42,69,129,163,184,194],"question":[4],"of":[5,22,50,72,74,143,165,183,193],"how":[6],"to":[7,45,112,157],"succinctly":[8],"approximate":[9],"a":[10,15,18,33,47,114,137,144,159,181,188],"multidimensional":[11],"convex":[12,19,48,145],"body":[13,20,146],"by":[14,79,177],"polytope.":[16],"Given":[17],"K":[21,58],"unit":[23],"diameter":[24],"in":[25,128],"Euclidean":[26],"d":[27,31,88,120],"-dimensional":[28],"space":[29],"(where":[30],"is":[32,44,59,110,126,134],"constant)":[34],"and":[35,81,147,187],"an":[36],"error":[37],"parameter":[38],"\u03b5":[39],">":[40],"0,":[41],"objective":[43],"determine":[46],"polytope":[49,115],"low":[51],"combinatorial":[52,64,123],"complexity":[53,65],"whose":[54],"Hausdorff":[55],"distance":[56],"from":[57],"at":[60],"most":[61],"\u03b5.":[62],"By":[63],",":[66],"we":[67,106,154],"mean":[68],"total":[70],"number":[71,164],"faces":[73],"all":[75],"dimensions.":[76],"Classical":[77],"constructions":[78],"Dudley":[80],"Bronshteyn/Ivanov":[82],"show":[83,107],"that":[84,108,168],"O":[85,117],"(1/\u03b5":[86,118],"(":[87,119],"-1)/2":[89,121],")":[90,122],"facets":[91],"or":[92],"vertices":[93],"are":[94,155,169],"possible,":[95],"respectively,":[96],"but":[97],"neither":[98],"achieves":[99],"both":[100],"bounds":[101],"simultaneously.":[102],"In":[103],"this":[104,152,179],"article,":[105],"it":[109],"possible":[111],"construct":[113],"with":[116,180],"complexity,":[124],"which":[125],"optimal":[127],"worst":[130],"case.":[131],"Our":[132],"result":[133,176],"based":[135],"on":[136,162],"new":[138],"relationship":[139],"between":[140],"\u03b5-width":[141],"caps":[142,167],"its":[148],"polar":[149],"body.":[150],"Using":[151],"relationship,":[153],"able":[156],"obtain":[158],"volume-sensitive":[160],"bound":[161],"approximating":[166],"\u201cessentially":[170],"different.\u201d":[171],"We":[172],"achieve":[173],"our":[174],"main":[175],"combining":[178],"variant":[182],"witness-collector":[185],"method":[186],"novel":[189],"variable-thickness":[190],"layered":[191],"construction":[192],"economical":[195],"cap":[196],"covering.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}