Skip to Main content Skip to Navigation
Conference papers

Efficient Lattice Width Computation in Arbitrary Dimension

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00827176
Contributor : Lilian Buzer <>
Submitted on : Wednesday, May 29, 2013 - 1:01:56 AM
Last modification on : Wednesday, February 26, 2020 - 7:06:06 PM

Links full text

Identifiers

Citation

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⟩

Share

Metrics

Record views

226