2018
DOI: 10.1137/17m1132045
|View full text |Cite
|
Sign up to set email alerts
|

Voronoi Cells of Lattices with Respect to Arbitrary Norms

Abstract: We study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show for strictly convex and smooth norms that the geometry of Voronoi cells of lattices in any dimension is similar to the Euclidean case, i.e., the Voronoi cells are defined by the so-called Voronoi-relevant vectors and the facets of a Voronoi cell are in one-to-one correspondence with these vectors. On the negative side, we show that Voronoi cells are combinatorially much more complica… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 20 publications
0
3
0
Order By: Relevance
“…Voronoi diagrams and bisectors of sites under general convex distances have been extensively studied [Blömer and Kohn 2018;Corbalan et al 1996;Deza and Sikirić 2015;He et al 2011;Icking et al 2001;Ma 2000;Martini and Swanepoel 2004;Väisälä 2013]. The interested reader can find a global classification of distances for Voronoi diagrams in chapter 20 of the textbook by Deza and Deza [2013].…”
Section: Voronoi Diagrams Induced By Star-shaped Metricsmentioning
confidence: 99%
“…Voronoi diagrams and bisectors of sites under general convex distances have been extensively studied [Blömer and Kohn 2018;Corbalan et al 1996;Deza and Sikirić 2015;He et al 2011;Icking et al 2001;Ma 2000;Martini and Swanepoel 2004;Väisälä 2013]. The interested reader can find a global classification of distances for Voronoi diagrams in chapter 20 of the textbook by Deza and Deza [2013].…”
Section: Voronoi Diagrams Induced By Star-shaped Metricsmentioning
confidence: 99%
“…Even with this information, the procedure might be time consuming, as there could be exponentially many Voronoi relevant vectors; cf. [9].…”
Section: Super-discrete Sets Of Sitesmentioning
confidence: 99%
“…Although the problem of finding a shortest basis is NP hard for general metrics [10], there is a single exponential time algorithm for the Euclidean space [11]. In non-Euclidean spaces, the number of Voronoi relevant vectors can be much larger [12].…”
Section: Choices Of Cellsmentioning
confidence: 99%