Digital straight-line segments based on a five-pixel neighborhood
✍ Scribed by Hiroshi Imura; Masayoshi Eguchi; Yasushi Fuwa; Yatsuka Nakamura
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 335 KB
- Volume
- 81
- Category
- Article
- ISSN
- 1042-0967
No coin nor oath required. For personal study only.
✦ Synopsis
In past studies, the digital straight-line segment is defined as a figure approximating the straight-line segment in the continuous space, by grid points in the discrete space. Because of this definition, the properties of the segment vary depending on the approximation process, which prevented the development of a general discussion. For this problem, the authors introduced a topology into the discrete space, and defined the digital straight-line segment using only the topology. As a result, the digital straight-line segment can be defined generally for various spaces and topologies, and the properties of the segment can be analyzed. In this paper, the properties of the digital straight-line segment are analyzed based on the 5-neighborhood concept. As the first step, the assertion that characterizes the digital straight-line segment, as well as five equivalent assertions are presented. Then, it is shown that by using those assertions, the corresponding segment generation algorithm can easily be obtained, and the figure generated by the segment generation algorithm which is known in the CG technology is the same as the proposed digital straight-line