Pregled bibliografske jedinice broj: 392792
Complexity and algorithms for computing Voronoi cells of lattices
Complexity and algorithms for computing Voronoi cells of lattices // Mathematics of computation, 78 (2009), 1713-1731 doi:10.1090/S0025-5718-09-02224-8 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 392792 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Complexity and algorithms for computing Voronoi cells of lattices
Autori
Dutour Sikirić, Mathieu ; Schuermann, Achill ; Vallentin, Frank
Izvornik
Mathematics of computation (0025-5718) 78
(2009);
1713-1731
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Voronoi cell ; enumeration ; quantizer constant
Sažetak
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a sharp p-hard problem. On the other hand we describe an algorithm for this problem which is especially suited for low dimensional (say dimensions at most 12) and for highly-symmetric lattices. We use our implementation, which drastically outperforms those of current computer algebra systems, to find the vertices of Voronoi cells and quantizer constants of some prominent lattices.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
098-0982705-2707 - Matematičko modeliranje cirkulacije i satelitska detekcija graničnih procesa (Kuzmić, Milivoj, MZOS ) ( CroRIS)
Ustanove:
Institut "Ruđer Bošković", Zagreb
Profili:
Mathieu Dutour Sikirić
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
