Sciweavers

256 search results - page 1 / 52
» Complexity and algorithms for computing Voronoi cells of lat...
Sort
View
CORR
2008
Springer
80views Education» more  CORR 2008»
13 years 4 months ago
Complexity and algorithms for computing Voronoi cells of lattices
Mathieu Dutour Sikiric, Achill Schürmann, Fra...
COMPGEOM
2000
ACM
13 years 9 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
CODCRY
2011
Springer
264views Cryptology» more  CODCRY 2011»
12 years 8 months ago
Algorithms for the Shortest and Closest Lattice Vector Problems
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
GMP
2010
IEEE
214views Solid Modeling» more  GMP 2010»
13 years 9 months ago
Efficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D d...
Dong-Ming Yan, Wenping Wang, Bruno Lévy, Ya...