Related Experiment Video
Updated: May 23, 2026

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
Published on: December 3, 2013
Digital convexity, straightness, and convex polygons
1Department of Computer Science, University of Maryland, College Park, MD 20742; Department of Computer Science, Washington State University, Pullman, WA 99163.
Abstract:
New schemes for digitizing regions and arcs are introduced. It is then shown that under these schemes, Sklansky's definition of digital convexity is equivalent to other definitions. Digital convex polygons of n vertices are defined and characterized in terms of geometric properties of digital line segments. Also, a linear time algorithm is presented that, given a digital convex region, determines the smallest integer n such that the region is a digital convex n-gon.
Related Concept Videos
The Dot Product
Curvilinear Motion: Normal and Tangential Components
The positive direction of the t-axis aligns with the increasing position of the car along the curved path, denoted by the unit vector ut. Simultaneously, the n-axis, perpendicular to the t-axis, dissects the curved path into differential arc segments, each forming the arc of a circle with a radius of...
Introduction to Vertical Curves
Vertical Curve: Problem Solving
Elevation of Intermediate Points on Vertical Curves
Degree of Curvature and Radius of Curvature

