@article{Lachaud:2013-dam,
title = "Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line ",
journal = "Discrete Applied Mathematics",
volume = "161",
number = "15",
pages = "2293 - 2315",
year = "2013",
note = "Advances in Discrete Geometry: 16th International Conference on Discrete Geometry for Computer Imagery ",
issn = "0166-218X",
doi = "http://dx.doi.org/10.1016/j.dam.2012.08.038",
url = "http://www.sciencedirect.com/science/article/pii/S0166218X12003381",
author = {J.-O. Lachaud and M. Said},
keywords = "Discrete geometry",
keywords = "Standard lines",
keywords = "Digital straight segment recognition",
keywords = "Stern–Brocot tree "
}