{"id":"https://openalex.org/W1971400259","doi":"https://doi.org/10.1090/s0025-5718-09-02224-8","title":"Complexity and algorithms for computing Voronoi cells of lattices","display_name":"Complexity and algorithms for computing Voronoi cells of lattices","publication_year":2009,"publication_date":"2009-02-06","ids":{"openalex":"https://openalex.org/W1971400259","doi":"https://doi.org/10.1090/s0025-5718-09-02224-8","mag":"1971400259"},"language":"en","primary_location":{"id":"doi:10.1090/s0025-5718-09-02224-8","is_oa":true,"landing_page_url":"https://doi.org/10.1090/s0025-5718-09-02224-8","pdf_url":"https://www.ams.org/mcom/2009-78-267/S0025-5718-09-02224-8/S0025-5718-09-02224-8.pdf","source":{"id":"https://openalex.org/S102439543","display_name":"Mathematics of Computation","issn_l":"0025-5718","issn":["0025-5718","1088-6842"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315719","host_organization_name":"American Mathematical Society","host_organization_lineage":["https://openalex.org/P4310315719"],"host_organization_lineage_names":["American Mathematical Society"],"type":"journal"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Computation","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.ams.org/mcom/2009-78-267/S0025-5718-09-02224-8/S0025-5718-09-02224-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mathieu Dutour Sikiri\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mathieu Dutour Sikiri\u0107","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Achill Sch\u00fcrmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Achill Sch\u00fcrmann","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Frank Vallentin","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frank Vallentin","raw_affiliation_strings":["Centrum voor Wiskunde en Informatica (CWI), Kruislaan 413, 1098 SJ Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Centrum voor Wiskunde en Informatica (CWI), Kruislaan 413, 1098 SJ Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9687,"has_fulltext":true,"cited_by_count":41,"citation_normalized_percentile":{"value":0.87153245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"78","issue":"267","first_page":"1713","last_page":"1731"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.11550000309944153,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.11550000309944153,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.09139999747276306,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.06449999660253525,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.9282000064849854},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5982000231742859},{"id":"https://openalex.org/keywords/centroidal-voronoi-tessellation","display_name":"Centroidal Voronoi tessellation","score":0.5943999886512756},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.47209998965263367},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.40959998965263367},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.3944999873638153},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3407000005245209},{"id":"https://openalex.org/keywords/euclidean-algorithm","display_name":"Euclidean algorithm","score":0.3382999897003174}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.9282000064849854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7335000038146973},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5982000231742859},{"id":"https://openalex.org/C205672865","wikidata":"https://www.wikidata.org/wiki/Q5062961","display_name":"Centroidal Voronoi tessellation","level":3,"score":0.5943999886512756},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.47209998965263367},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42809998989105225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41510000824928284},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.40959998965263367},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.3944999873638153},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35040000081062317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3407000005245209},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C20468658","wikidata":"https://www.wikidata.org/wiki/Q17130624","display_name":"Weighted Voronoi diagram","level":3,"score":0.2849000096321106},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C20573064","wikidata":"https://www.wikidata.org/wiki/Q13410436","display_name":"Power diagram","level":3,"score":0.2624000012874603}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/s0025-5718-09-02224-8","is_oa":true,"landing_page_url":"https://doi.org/10.1090/s0025-5718-09-02224-8","pdf_url":"https://www.ams.org/mcom/2009-78-267/S0025-5718-09-02224-8/S0025-5718-09-02224-8.pdf","source":{"id":"https://openalex.org/S102439543","display_name":"Mathematics of Computation","issn_l":"0025-5718","issn":["0025-5718","1088-6842"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315719","host_organization_name":"American Mathematical Society","host_organization_lineage":["https://openalex.org/P4310315719"],"host_organization_lineage_names":["American Mathematical Society"],"type":"journal"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Computation","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0804.0036","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0804.0036","pdf_url":"https://arxiv.org/pdf/0804.0036","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1090/s0025-5718-09-02224-8","is_oa":true,"landing_page_url":"https://doi.org/10.1090/s0025-5718-09-02224-8","pdf_url":"https://www.ams.org/mcom/2009-78-267/S0025-5718-09-02224-8/S0025-5718-09-02224-8.pdf","source":{"id":"https://openalex.org/S102439543","display_name":"Mathematics of Computation","issn_l":"0025-5718","issn":["0025-5718","1088-6842"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315719","host_organization_name":"American Mathematical Society","host_organization_lineage":["https://openalex.org/P4310315719"],"host_organization_lineage_names":["American Mathematical Society"],"type":"journal"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320337180","display_name":"Hausdorff Research Institute for Mathematics","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1971400259.pdf","grobid_xml":"https://content.openalex.org/works/W1971400259.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,68],"paper":[2],"we":[3,24,63],"are":[4],"concerned":[5],"with":[6],"finding":[7],"the":[8,11,28,60,112],"vertices":[9,31,113],"of":[10,14,21,30,105,114,120],"Voronoi":[12,115],"cell":[13],"a":[15,19,22,33],"Euclidean":[16],"lattice.":[17],"Given":[18],"basis":[20],"lattice,":[23],"prove":[25],"that":[26],"computing":[27],"number":[29],"is":[32,71],"<inline-formula":[34,80],"content-type=\"math/mathml\">":[35,81],"<mml:math":[36,82],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[37,83],"alttext=\"number-sign":[38],"normal":[39],"upper":[40],"P\">":[41],"<mml:semantics>":[42,85],"<mml:mrow>":[43],"<mml:mi":[44,48],"mathvariant=\"normal\">":[45],"#":[46],"</mml:mi>":[47],"mathvariant=\"normal\">P</mml:mi>":[49],"</mml:mrow>":[50],"<mml:annotation":[51,87],"encoding=\"application/x-tex\">\\#\\operatorname":[52],"{P}</mml:annotation>":[53],"</mml:semantics>":[54,89],"</mml:math>":[55,90],"</inline-formula>":[56,91],"-hard":[57],"problem.":[58],"On":[59],"other":[61],"hand,":[62],"describe":[64],"an":[65],"algorithm":[66],"for":[67,74,94],"problem":[69],"which":[70,101],"especially":[72],"suited":[73],"low-dimensional":[75],"(say":[76],"dimensions":[77],"at":[78],"most":[79],"alttext=\"12\">":[84],"<mml:mn>12</mml:mn>":[86],"encoding=\"application/x-tex\">12</mml:annotation>":[88],")":[92],"and":[93,117],"highly-symmetric":[95],"lattices.":[96,123],"We":[97],"use":[98],"our":[99],"implementation,":[100],"drastically":[102],"outperforms":[103],"those":[104],"current":[106],"computer":[107],"algebra":[108],"systems,":[109],"to":[110],"find":[111],"cells":[116],"quantizer":[118],"constants":[119],"some":[121],"prominent":[122]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-22T06:01:30.510260","created_date":"2016-06-24T00:00:00"}
