Digital Straight Lines and Convexity of Digital Regions
- 1 March 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-4 (2) , 149-153
- https://doi.org/10.1109/tpami.1982.4767221
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
This publication has 12 references indexed in Scilit:
- On the Cellular Convexity of ComplexesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Parallel Computation of Contour PropertiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Convexity Verification, Block-Chords, and Digital Straight LinesComputer Graphics and Image Processing, 1977
- Parallel Detection of Concavities in Cellular BlobsIEEE Transactions on Computers, 1976
- Arcs and Curves in Digital PicturesJournal of the ACM, 1973
- Minimum-Perimeter Polygons of Digitized SilhouettesIEEE Transactions on Computers, 1972
- Discrete Approximation of Continuous Convex BlobsSIAM Journal on Applied Mathematics, 1970
- On Limit Properties in Digitization SchemesJournal of the ACM, 1970
- Recognition of convex blobsPattern Recognition, 1970
- Connectivity in Digital PicturesJournal of the ACM, 1970