By Topic

Three-Dimensional Digital Planes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chul E. Kim ; Department of Computer Science, Washington State University, Pullman, WA 99164.

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.

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:PAMI-6 ,  Issue: 5 )