Title :
Digital Straight Lines and Convexity of Digital Regions
Author :
Kim, Chul E. ; Rosenfeld, Azriel
Author_Institution :
Department of Computer Science, University of Maryland, College Park, MD 20742; Department of Computer Science, Washington State University, Pullman, WA 99163.
fDate :
3/1/1982 12:00:00 AM
Abstract :
It is shown that a digital region is convex if and only if every pair of points in the region is connected by a digital straight line segment contained in the region. The midpoint property is shown to be a necessary but not a sufficient condition for the convexity of digital regions. However, it is shown that a digital region is convex if and only if it has the median-point property.
Keywords :
Computer science; Computer vision; Geometry; Joining processes; Laboratories; Sufficient conditions; Convexity; digital geometry; straightness;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
DOI :
10.1109/TPAMI.1982.4767221
