A library of various computational geometry tools.

Implementation of unconstrained and constrained convex optimization algorithms in Python, focusing on solving data science problems such as semi-supervised learning and Support Vector Machines.

Halfspace Intersection - Calculate and draw convex polytopes from half-space equations

Fast C++ multi-threaded algorithm for computing convex hulls

📐 Polygonization using CGAL

Visualize the KPS and Jarvis March Algorithm

Crystal implementation of finding the convex hull of a finite set of points in the plane

Convex-Hull-and-Line-Intersection-Algorithms-With-Visualization. Convex Hull Algorithms: - Graham Scan Algorithm - Jarvis March or Gift Wrapping Algorithm - Bruteforce Algorithm - Quick Hull . Line Intersection Algorithms - CCW - Cramers Method - Vector Method - Graph Algorithms - Dijkstra - Kruskal - Max Flow - Havel Hakimi

Java Collision Detection and Physics Engine

📐Implementation of various convex hull algorithms as well as Voronoi diagrams, Delaunay triangulation and geometric search.

Convex Hull Algorithms (2D & 3D), KD-Trees, Orthogonal Search, Delaunay Triangulation

A) Convex Hull 2D-3D Algorithms B) KD-Trees, Orthogonal Search, Voronoi Diagrams, Delaunay Triangulation

🧮 Implementation of Convex Hull Algorithms in Python

C++ implementations of real time dynamic planar convex hull construction algorithms.

Baek - Joon Online Judge Solving Problems

Solution to the assignments of my academic course for Computational Geometry

Final project for the "GPU Architecures and Computing" @ TU Wien

Project written as part of the "Geometric algorithms" course. Implementations of Convex Hull Search Algorithms with step-by-step visualizations. Written using Python language.

CPU and GPU implementations of algorithms solving the convex hull problem in C++.

Convex Hull algorithm