Covering a Euclidean line or hyperplane by dilations of its discretization

DOI10.1007/s10013-016-0202-2zbMath1372.68265OpenAlexW2418382764MaRDI QIDQ2405479

Adama Arouna Koné

Publication date: 25 September 2017

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10013-016-0202-2

zbMATH Keywords

discretizationdilationoptimal coveringEuclidean and digital hyperplanesEuclidean and digital lines

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The supercover of an \(m\)-flat is a discrete analytical object
• Digital straightness -- a review
• Three-Dimensional Digital Planes
• How a Digital Computer Can Tell Whether a Line is Straight
• Three-Dimensional Digital Line Segments
• Digital Straight Line Segments
• Optimal Covering of a Straight Line Applied to Discrete Convexity
• Sequential Operations in Digital Picture Processing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering a Euclidean line or hyperplane by dilations of its discretization