Remainder Approach for the Computation of Digital Straight Line Subsegment Characteristics

Abstract : Given a digital straight line D of known characteristics (a, b, c), and given two arbitrary discrete points A(x a , y a ) and B(x b , y b ) of it, we are interested in computing the characteristics of the digital straight segment (DSS) of D delimited by the endpoints A and B. Our method is based entirely on the remainder subsequence S = {ax − c mod b; x a ≤ x ≤ x b }. We show that minimum and maximum remainders correspond to the three leaning points of the subsegment needed to determine its characteristics. One of the key aspects of the method is that we show that computing such a minimum and maximum of a remainder sequence can be done in logarithmic time with an algorithm akin to the Euclidean algorithm. Experiments show that our algorithm is faster than the previous ones proposed by Said and Lachaud in [11] and Sivignon in [16].
Type de document :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2014, pp.1-12. 〈10.1016/j.dam.2014.06.006〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00997556
Contributeur : Eric Andres <>
Soumis le : lundi 7 juillet 2014 - 10:41:26
Dernière modification le : lundi 13 octobre 2014 - 15:43:25
Document(s) archivé(s) le : mardi 7 octobre 2014 - 10:40:49

Fichier

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Jean-Serge Dimitri Ouattara, Eric Andres, Gaëlle Largeteau-Skapin, Rita Zrour, Théodore Tapsoba. Remainder Approach for the Computation of Digital Straight Line Subsegment Characteristics. Discrete Applied Mathematics, Elsevier, 2014, pp.1-12. 〈10.1016/j.dam.2014.06.006〉. 〈hal-00997556〉

Partager

Métriques

Consultations de la notice

329

Téléchargements de fichiers

595