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.
CITATION STYLE
Sivignon, I. (2014). Algorithms for fast digital straight segments union. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8668, 344–357. https://doi.org/10.1007/978-3-319-09955-2_29
Mendeley helps you to discover research relevant for your work.