Algorithms for Fast Digital Straight Segments Union

Isabelle Sivignon (1)

1 GIPSA-AGPIG - GIPSA - Architecture, Géométrie, Perception, Images, Gestes

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.

Mots clés: Digital geometry; Union; Digital straight segment

Domaines: Traitement des images [eess.IV]

Isabelle Sivignon. Algorithms for Fast Digital Straight Segments Union. Discrete Geometry for Computer Imagery, Sep 2014, Sienne, Italy. pp.344-357, ⟨10.1007/978-3-319-09955-2_29⟩. ⟨hal-01120581⟩