Efficient Lattice Width Computation in Arbitrary Dimension

DOI10.1007/978-3-642-04397-0_5zbMath1261.68123MaRDI QIDQ3648771

Émilie Charrier, Fabien Feschet, Lilian Buzer

Publication date: 1 December 2009

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04397-0_5

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Computing efficiently the lattice width in any dimension

Cites Work

• Minimal ellipsoids and maximal simplexes in 3D Euclidean space
• On integer points in polyhedra
• Simultaneous inner and outer approximation of shapes
• Higher dimensional continued fractions
• Finding a shortest vector in a two-dimensional lattice modulo m
• A linear algorithm for integer programming in the plane
• Integer Programming with a Fixed Number of Variables
• Finding Extremal Polygons
• Computing the width of a set
• The Generalized Gauss Reduction Algorithm
• A Polynomial Algorithm for the Two-Variable Integer Programming Problem
• Production Sets with Indivisibilities, Part I: Generalities
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• Computing Two-Dimensional Integer Hulls
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item