Skip to content

Latest commit

 

History

History
4 lines (3 loc) · 406 Bytes

README.md

File metadata and controls

4 lines (3 loc) · 406 Bytes

compgeo

This is a library I created initially for the Computational Geometry class at the Rochester Institute of Technology taught by Professor Reynold Bailey. I took the class while working on my Masters of Science in Computer Science.

This library contains algorithms for Convex Hulls, Delaunay triangulation, segment intersections, trapezoidal maps, and the implementations of the class assignments.