Abstract

Recently, a new subdivision method was introduced by the author for smoothing polygons and polylines while preserving the enclosed area [Gordon D. Corner cutting and augmentation: an area-preserving method for smoothing polygons and polylines. Computer Aided Geometric Design 2010; 27(7):551–62]. The new technique, called “corner cutting and augmentation” (CCA), operates by cutting corners with line segments and adding the cut area of each corner to two augmenting structures constructed on the two incident edges; this operation can be iterated as needed. Area is preserved in a local sense, meaning that when a corner is cut, the cut area is added to the other side of the line in immediate proximity to the cut corner. Thus, CCA is also applicable to self-intersecting polygons and polylines, and it enables local control. CCA was originally developed with triangular augmentation, which was called CCA1. This work presents CCA2, in which the augmenting structures are trapezoids. A theoretical result from previous work is used to show that certain implementation restrictions guarantee the existence and the G 1 -continuity of the limit curve of CCA2, and also the preservation of convexity. The main difference between CCA1 and CCA2 is that the limit curve of CCA1 does not contain straight line segments, while CCA2 can contain such segments. CCA2 allows the user to determine how closely each iteration follows its previous polygon. Potential applications include computer aided geometric design, an alternative to spline approximation, an aid to artistic design, and a possible alternative to multiresolution curves.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call