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

Authors:
Wayne Brown;Leemon Baird
Affiliations:
The United States Air Force Academy, USAF Academy, CO;The United States Air Force Academy, USAF Academy, CO
Venue:
Journal of Computing Sciences in Colleges
Year:
2008

Citing 3
Cited 0

Geometric modeling

Geometric modeling
Smooth paths in a polygonal channel

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Appearance-preserving manipulation of hand-drawn graphs

GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.