Digital Convexity, Straightness, and Convex Polygons

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

Citing 0
Cited 6

Fast, accurate and convergent tangent estimation on digital contours

Image and Vision Computing
Discrete sets with minimal moment of inertia

Theoretical Computer Science
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
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

New schemes for digitizing regions and arcs are introduced. It is then shown that under these schemes, Sklansky's definition of digital convexity is equivalent to other definitions. Digital convex polygons of n vertices are defined and characterized in terms of geometric properties of digital line segments. Also, a linear time algorithm is presented that, given a digital convex region, determines the smallest integer n such that the region is a digital convex n-gon.