Description
to understand different types of Geometric Algorithms. As a part of my thesis I have developed Line Sweep Algorithm and a graphical user interface which is capable of taking different kinds of input. This input can be either a point, line or a polygon. The output can be any self- balancing tree. In this case, I have chosen, AVL — Tree. This suite is a collection of geometric algorithms which will provide better understanding along with the scope for addition of more algorithms. This framework supports Line Sweep Algorithm, Polygon Triangulation, Orthogonal Range Searching, Trapezoidal Maps and Voronoi Diagrams. Out of the algorithms mentioned above, Line Sweep Algorithm takes lines as input. It is implemented in Java using Swings. It provides other features like saving a particular example and loading it into the system for future reference. The generic graphical user interface of this application allows other user to implement other algorithms. The reason for developing this framework is mainly for academics purpose. This application will provide a tool for faculty members to explain the algorithms with ease showing examples. It will be helpful to students in understanding the exact working of the algorithms and the manipulation of the data structure. This application will help the development of the other Geometric algorithms.
