Efficient Lattice Width Computation in Arbitrary Dimension - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Efficient Lattice Width Computation in Arbitrary Dimension

Lilian Buzer
Fabien Feschet

Résumé

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.

Dates et versions

hal-00827176 , version 1 (29-05-2013)

Identifiants

Citer

Lilian Buzer, Émilie Charrier, Fabien Feschet. Efficient Lattice Width Computation in Arbitrary Dimension. Discrete Geometry for Computer Imagery, Oct 2009, Canada. pp 46-56, ⟨10.1007/978-3-642-04397-0_5⟩. ⟨hal-00827176⟩
75 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More