activity
20012026
most citedComplexity and algorithms for computing Voronoi cells of lattices

44 citations · 182 across the 28 of their papers we have counts for

collaborators
Showing 2005Show all

2 papers · 1 filter

math.CO2005

How to compute the rank of a Delaunay polytope

Mathieu Dutour Sikiric, Viatcheslav Grishukhin

Roughly speaking, the rank of a Delaunay polytope (first introduced in \cite{DGL92}) is its number of degrees of freedom. In \cite{DL}, a method for computing the rank of a Delauna…

math.CO2005

Cube packings, second moment and holes

Mathieu Dutour, Yoshiaki Itoh, Alexei Poyarkov

We consider tilings and packings of $\RR^d$ by integral translates of cubes , which are $4\ZZ^d$-periodic. Such cube packings can be described by cliques of an associated…