A Smoothest Path algorithm and its visualization tool
J. Andrew Roles, Hala ElAarag · 2013
In this paper we present an extension of the Shortest Path Problem: the Smoothest Path. A Smoothest Path algorithm optimizes both distance and slope to produce the least rigorous path available. Useful in simulated and real-world path finding, a smoothest path algorithm can provide useful data for a variety of applications. While smooth path algorithms exist, the notion of a smoothest path is fairly new. Simulated visualizations of algorithms have become a popular and effective learning tool. In the past, algorithms have been taught through exhaustive chalkboard drawings and pseudo-code guidelines. Visualization tools are therefore an attractive learning essential for instructors and students alike. Increased performance in languages such as Java along with robust graphical interfacing libraries such as Swing and JOGL make this a conquerable problem. In this paper, we also present a tool to visualize our smoothest path algorithm. Our goal is to simplify the algorithm into a series of visual steps that can be understood by elementary computer science students.