Algorithms for Fast Digital Straight Segments Union

Isabelle Sivignon 1, *
* Auteur correspondant
1 GIPSA-AGPIG - AGPIG
GIPSA-DIS - Département Images et Signal
Abstract : Given two Digital Straight Segments (DSS for short) of known minimal characteristics, we investigate the union of these DSSs: is it still a DSS ? If yes, what are its minimal characteristics ? We show that the problem is actually easy and can be solved in, at worst, logarithmic time using a state-of-the-art algorithm. We moreover propose a new algorithm of logarithmic worst-case complexity based on arithmetical properties. But when the two DSSs are connected, the time complexity of this algorithm is lowered to O(1) and experiments show that it outperforms the state-of-the art one in any case.
Type de document :
Communication dans un congrès
Discrete Geometry for Computer Imagery, Sep 2014, Sienne, Italy. Springer, 8668, pp.344-357, 2014, Lecture Notes in Computer Science. <10.1007/978-3-319-09955-2_29>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01120581
Contributeur : Isabelle Sivignon <>
Soumis le : jeudi 26 février 2015 - 09:48:51
Dernière modification le : lundi 5 décembre 2016 - 20:52:47
Document(s) archivé(s) le : mercredi 27 mai 2015 - 11:42:13

Fichier

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

Identifiants

Collections

Citation

Isabelle Sivignon. Algorithms for Fast Digital Straight Segments Union. Discrete Geometry for Computer Imagery, Sep 2014, Sienne, Italy. Springer, 8668, pp.344-357, 2014, Lecture Notes in Computer Science. <10.1007/978-3-319-09955-2_29>. <hal-01120581>

Partager

Métriques

Consultations de
la notice

93

Téléchargements du document

73