Document Type

Honors Project

First Advisor

Dr. Verne Leininger

Second Advisor

Dr. Eric McGregor

Third Advisor

Dr. James Bowling

Degree Award Date

2023

Keywords

computational geometry, algorithms, visualization, Voronoi diagram, convex hull, intersection, triangulation

Disciplines

Graphics and Human Computer Interfaces | Theory and Algorithms

Abstract

Computational geometry is a branch of computer science dedicated to the study and development of algorithms that solve geometric problems. These algorithms are often complex, so this project involves the development of a teaching tool for various computational geometry algorithms. A Node app was developed which allows a user to create their own inputs for an algorithm and watch a visualization of how an algorithm solves one of the various problems. There is highlighted pseudocode matching the steps of the visualization along with more in-depth writeups of the inner workings of the algorithm. 4 algorithms have been implemented in the original project, matching the following foundational computational geometry problems: convex hull, line segment intersection, triangulation, and Voronoi diagrams. The algorithms selected represent some of the core principles key to solving many problems in the field. The resulting web application is a user-friendly and instructive way for people to understand and see how these algorithms function. There is still room for improvement to make the visualizations more useable and pseudocode easier to comprehend. Additionally, there is a wide range of further algorithms and problems that could be implemented.

Force Open Access

1

Download

Share

COinS