Computational Geometry Algorithms in C++/CGAL

This project implements and benchmarks computational geometry exercises using C++ and the CGAL library.

Topics

• Orientation predicates and numerical robustness
• Comparison of Simple Cartesian, EPICK, and EPECK kernels
• Segment intersection with exact and inexact constructions
• Random point generation on circle, disk, square, and triangle distributions
• Convex hull benchmarking using Graham-Andrew, Jarvis March, and Akl-Toussaint algorithms

Contents

• assignment2.cpp: C++ implementation
• Report.pdf: benchmark results and discussion

Technologies

C++, CGAL, Boost.Multiprecision