Now showing items 1-2 of 2
Evading Triangles without a map
We divise a heuristic which enables a traveler to traverse the plane from a start point S to a target point T while evading unknown obstacles. The obstacles are assumed to be equilateral triangles which are all translates ...
Triangulations and Simplex Tilings of Polyhedra
This dissertation summarizes my research in the area of Discrete Geometry. The particular problems of Discrete Geometry discussed in this dissertation are concerned with partitioning three dimensional polyhedra into ...