Implementations of algorithms introduced and/or related to the course "Computational Geometry" attended in the fall semester 2015 at SDU, Denmark.
SDL is used for visualizations.
- Convex hull
- Line Segment Intersection
- Circular linked list (from open source BSD library queue.h)
- Red Black (Balanced) Search Trees (pseudocode from [Cormen])
- Leaf-Oriented Balanced Search Trees (based on the red-black tree implementation)
- Course litterature: Computational Geometry by Mark de Berg et al., 3rd edition (March 2008)
- SDL 2.0 API by Category
- SDL 2.0 API by Name
- Introduction to Algorithms by Cormen et al., 3rd edition (2009)
The structure of this project still undergoes development. In particular, tests are not properly done yet, as well as the compilation-workflow.