Convex digital solids

C E Kim, A Rosenfeld
1982 IEEE Transactions on Software Engineering  
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