Name
Abstract | ||
|---|---|---|
A polyhedral norm is a norm N on R n for which the set N ( x ) ¿ 1 is a polytope. This covers the case of the L 1 and L ∞ norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point set being a lattice. The algorithms, that we propose, use the symmetries effectively in order to compute a decomposition of the space into convex polytopes named V N -spaces. The Voronoi polytopes and other geometrical information are easily obtained from it. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.dam.2014.09.007 | Discrete Applied Mathematics |
Keywords | Field | DocType |
enumeration | Discrete mathematics,Combinatorics,Lattice (order),Enumeration,Regular polygon,Polytope,Voronoi diagram,Point set,Homogeneous space,Mathematics | Journal |
Volume | Issue | ISSN |
197 | C | 0166-218X |
Citations | PageRank | References |
2 | 0.38 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michel Deza | 1 | 281 | 68.20 |
| Mathieu Dutour Sikiric | 2 | 18 | 4.50 |