Digital Planarity - A Review

Abstract : Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid-point or the grid-cube model. The paper summarizes results (also including most of the proofs) about different aspects of digital planarity, such as supporting or separating Euclidean planes, characterizations in arithmetic geometry, periodicity, connectivity, and algorithmic solutions. The paper provides a uniform presentation, which further extends and details a recent book chapter in \cite{KLE2004}.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00185059
Contributor : David Coeurjolly <>
Submitted on : Tuesday, November 6, 2007 - 11:20:59 AM
Last modification on : Tuesday, August 13, 2019 - 11:40:13 AM
Long-term archiving on : Monday, June 27, 2011 - 4:31:44 PM

Files

article_RR.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Valentin Brimkov, David Coeurjolly, Reihnard Klette. Digital Planarity - A Review. Discrete Applied Mathematics, Elsevier, 2007, 155 (4), pp.468-495. ⟨10.1016/j.dam.2006.08.004⟩. ⟨hal-00185059⟩

Share

Metrics

Record views

346

Files downloads

165