Abstract
We address the problem of computing the exact characteristics of any subsegment of a digital straight line with known characteristics. We present a new algorithm that solves this problem, whose correctness is proved. Its principle is to climb the Stern-Brocot tree of fraction in a bottom-up way. Its worst-time complexity is proportionnal to the difference of depth of the slope of the input line and the slope of the output segment. It is thus logarithmic in the coefficients of the input slope. We have tested the effectiveness of this algorithm by computing a multiscale representation of a digital shape, based only on a digital straight segment decomposition of its boundary. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Said, M., & Lachaud, J. O. (2011). Computing the characteristics of a subsegment of a digital straight line in logarithmic time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6607 LNCS, pp. 320–332). https://doi.org/10.1007/978-3-642-19867-0_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
