Computer Science – Discrete Mathematics
Scientific paper
2009-06-12
Proc. Int. Conf. Discrete Geometry for Computer Imagery (DGCI2006), Szeged : Hongrie (2006)
Computer Science
Discrete Mathematics
Scientific paper
10.1007/11907350_30
This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognition algorithm proposed by I. Debled-Rennesson and J.-P. Reveill\`es in 1995 [Debled95]. We indeed exhibit the relations describing the possible changes in the parameters of the digital straight segment under investigation. This description is achieved by considering new parameters on digital segments: instead of their arithmetic description, we examine the parameters related to their combinatoric description. As a result we have a better understanding of their evolution during recognition and analytical formulas to compute them. We also show how this evolution can be projected onto the Stern-Brocot tree. These new relations have interesting consequences on the geometry of digital curves. We show how they can for instance be used to bound the slope difference between consecutive maximal segments.
Lachaud Jacques-Olivier
Vieilleville François de
No associations
LandOfFree
Revisiting Digital Straight Segment Recognition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Revisiting Digital Straight Segment Recognition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Revisiting Digital Straight Segment Recognition will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-136919