Digital Straight Lines and Convexity of Digital Regions

Authors:
Chul E. Kim;Azriel Rosenfeld
Affiliations:
Department of Computer Science, University of Maryland, College Park, MD 20742/ Department of Computer Science, Washington State University, Pullman, WA 99163.;FELLOW, IEEE, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1982

Citing 0
Cited 6

Classification of pathological shapes using convexity measures

Pattern Recognition Letters
Lyndon + Christoffel = digitally convex

Pattern Recognition
Faithful polygonal representation of the convex and concave parts of a digital curve

Pattern Recognition
A simple proof of Rosenfeld's characterization of digital straight line segments

Pattern Recognition Letters
From Binary to Grey Scale Convex Hulls

Fundamenta Informaticae
Optimal covering of a straight line applied to discrete convexity

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.14

Visualization

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.