再论数字直线段识别
Revisiting Digital Straight Segment Recognition
摘要:
本文提出了数字直线段的新结果,它们的识别和有关性质。它们来自于对I. Debled-Rennesson和J. P. Reveillès,1995年[Debled 95]。我们确实表现出的关系,描述了可能的变化,在调查中的数字直线段的参数。这种描述是通过考虑数字段上的新参数来实现的:而不是它们的算术描述,我们研究与它们的组合描述相关的参数。因此,我们有一个更好的理解他们的演变过程中的识别和分析公式来计算他们。我们还展示了如何将这种演变投射到Stern-Brocot树上。这些新的关系有有趣的后果的几何数字曲线。我们展示了它们如何可以例如被用来约束连续的最大段之间的斜率差。
英文摘要:
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ès 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。