Digitization of straight line segments closeness and convexity
暂无分享,去创建一个
Abstract In her thesis “Digitisation Functions in Computer Graphics” M. van Lierop presents a framework in which one can mathematically describe digitization of straight line segments, and desirable properties of this digitization, such as translation invariance, closeness, minimality, and convexity (convexity is sometimes called “the subset line property”). In the second chapter of her thesis she proves that a line function that has these four properties does not exist, and the remaining question is whether closeness and convexity are mutually exclusive properties (even if one drops minimality or translation invariance). In this paper we will answer this question affirmatively.
[1] van Mlp Marloes Lierop. Digitisation functions in computer graphics , 1987 .
[2] Azriel Rosenfeld,et al. Digital Straight Lines and Convexity of Digital Regions , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] Wm. Randolph Franklin. Problems with raster graphics algorithms , 1986 .
[4] Cornelius W. A. M. van Overveld,et al. Line rasterization algorithms that satisfy the subset line property , 1988, Comput. Vis. Graph. Image Process..