A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A definition of convexity of digital solids is introduced. Then it is proved that a digital solid is convex if and only if it has the chordal triangle property. Other geometric properties which characterize convex digital regions are shown to be only necessary, but not sufficient, conditions for a digital solid to be convex. An efficient algorithm that determines whether or not a digital solid is convex is presented.pmid:22499635 fatcat:zgwvtx476rgvdicfqxigulzkuq