Answers are grounded in this paper and cite their sources.
Definitions of 3-D digital surface and plane are introduced. Many geometric properties of these objects are examined. In particular, it is shown that digital convexity is neither a necessary nor a sufficient condition for a digital surface element to be a convex digital plane element, but it is both necessary and sufficient for a digital surface to be a digital plane. Also algorithms are presented to determine whether or not a finite set of digital points is a (convex) digital plane element.
No takes yet. Share an insight, caveat, or question.
Chul E. Kim (1984) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: