Computing the Voronoi cell of a lattice: the diamond-cutting algorithm

DOI10.1109/18.481786zbMATH Open0853.68166OpenAlexW2104242142WikidataQ63961292 ScholiaQ63961292MaRDI QIDQ4879998FDOQ4879998

Authors: Emanuele Viterbo, Ezio Biglieri 

Publication date: 2 June 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.481786

Recommendations

• Complexity and algorithms for computing Voronoi cells of lattices
• On the Voronoi Regions of Certain Lattices
• scientific article; zbMATH DE number 1456828

zbMATH Keywords

Voronoi celladditive white Gaussian noise channellattice constellation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Channel models (including quantum) in information and communication theory (94A40)

Cited In (10)

• A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
• Finding the closest lattice point by iterative slicing
• FastSpline: automatic generation of interpolants for lattice samplings
• Voronoi-like partition of lattice in cellular automata
• The Optimal Lattice Quantizer in Nine Dimensions
• Near-ellipsoidal voronoi coding
• Complexity and algorithms for computing Voronoi cells of lattices
• Investigation of medical 3D-rendering algorithms
• The irreducible vectors of a lattice: some theory and applications
• Rapid Bravais-lattice determination algorithm for lattice parameters containing large observation errors

This page was built for publication: Computing the Voronoi cell of a lattice: the diamond-cutting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879998)