Computational geometry: an introduction
Computational geometry: an introduction
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
Fast 2-Variable Integer Programming
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Recognizing arithmetic straight lines and planes
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
A linear algorithm for integer programming in the plane
Mathematical Programming: Series A and B
An elementary digital plane recognition algorithm
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Efficient lattice width computation in arbitrary dimension
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Computing efficiently the lattice width in any dimension
Theoretical Computer Science
| Hi-index | 0.00 |
We provide in this paper an algorithm for the exact computation of the lattice width of an integral polygon K with n vertices in O(n log s) arithmetic operations where s is a bound on all integers defining vertices and edges. We also provide an incremental version of the algorithm whose update complexity is shown to be O(log n + log s). We apply this algorithm to construct the arithmetical line with minimal thickness, which contains a given set of integer points.