|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Fall 2010 Angle Constrained Spanners: An Implementation Dustin Jackson 
ABSTRACT Computation Geometry is a growing discipline that has countless real-world applications. This report is focused on Spanner Graphs and their potential. Problems of many different flavours can be directly modeled using Spanner graphs. Some of these applications are explored in this report including the Delaunay Triangulation and approximating Minimum Spanning Trees. Furthermore, an implementation of a theta-angle constrained Spanner graph is demonstrated. It is intended that this report provides a general understanding of Geometric Networks, Well Separated Pair Decomposition, and Spanner Graphs. |
||||||
|
