Theory of linear and integer programming
Theory of linear and integer programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
The generalized Gauss reduction algorithm
Journal of Algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
Journal of the ACM (JACM)
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
Journal of the ACM (JACM)
Computing Two-Dimensional Integer Hulls
SIAM Journal on Computing
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Minimal Ellipsoids and Maximal Simplexes in 3D Euclidean Space
Cybernetics and Systems Analysis
A linear algorithm for integer programming in the plane
Mathematical Programming: Series A and B
On a general method for maximizing and minimizing among certain geometric problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
The exact lattice width of planar sets and minimal arithmetical thickness
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Computing efficiently the lattice width in any dimension
Theoretical Computer Science
| Hi-index | 0.00 |
We provide an algorithm for the exact computation of the lattice width of an integral polygon K in linear-time with respect to the size of K. Moreover, we describe how this new algorithm can be extended to an arbitrary dimension thanks to a greedy approach avoiding complex geometric processings.