A non-trigonometric, pseudo area preserving, polyline smoothing algorithm

A line-smoothing algorithm based on simple arithmetic is presented and its characteristics are analyzed for various implementations. The algorithm is efficient because it can be implemented using only simple integer arithmetic, with no square root or trigonometric calculations. The algorithm is applicable to graph drawing applications that require smooth polylines between graph nodes. Though the algorithm is efficient, it is sensitive to seemingly minor implementation details which make it an illustrative and illuminating student/classroom exercise for the discussion of integer round-off, integer overflow, and the importance of implementation details.