Optimal covering of a straight line applied to discrete convexity - AGPIG Accéder directement au contenu
Communication Dans Un Congrès Lecture Notes in Computer Science Année : 2013

Optimal covering of a straight line applied to discrete convexity

Résumé

The relation between a straight line and its digitization as a digital straight line is often expressed using a notion of proximity. In this contribution, we consider the covering of the straight line by a set of balls centered on the digital straight line pixels. We prove that the optimal radius of the balls is strictly less than one, and can be expressed as a function of the slope of the straight line. This property is used to define discrete convexity in concordance with previous works on convexity.
Fichier principal
Vignette du fichier
article_final.pdf (321.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00765865 , version 1 (17-12-2012)

Identifiants

  • HAL Id : hal-00765865 , version 1

Citer

Jean-Marc Chassery, Isabelle Sivignon. Optimal covering of a straight line applied to discrete convexity. DGCI 2013 - 17th IAPR International Conference on Discrete Geometry for Computer Imagery, Mar 2013, Séville, Spain. pp.1-10. ⟨hal-00765865⟩
144 Consultations
157 Téléchargements

Partager

Gmail Facebook X LinkedIn More