Digital straightness and convexity (Extended Abstract)

Authors:
Chul E. Kim;Azriel Rosenfeld
Affiliations:
-;-
Venue:
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Year:
1981

Citing 3
Cited 3

On Limit Properties in Digitization Schemes

Journal of the ACM (JACM)
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
Digital Picture Processing

Digital Picture Processing

Digital disks and a digital compactness measure

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Digital straightness: a review

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Faithful polygonal representation of the convex and concave parts of a digital curve

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define straightness and convexity of regions in a digital picture. Then it is shown that a few important properties satisfied by convex (Euclidean) regions are also satisfied by convex digital regions. We extend the definition of digital convexity of regions to digital solids. Efficient algorithms are presented that determine whether or not a digital region is convex, a digital arc is a digital straight line segment and a digital solid is convex.