Fast C++ multi-threaded algorithm for computing convex hulls
-
Updated
Apr 13, 2024 - C++
Fast C++ multi-threaded algorithm for computing convex hulls
📐 Polygonization using CGAL
C++ implementations of real time dynamic planar convex hull construction algorithms.
Solution to the assignments of my academic course for Computational Geometry
Final project for the "GPU Architecures and Computing" @ TU Wien
C++ code for computing the convex hull of a polygon
The dynamic convex hull algorithm by Overmars and van Leeuwen, also including concatenable queue, implemented using a leaf-oriented 2-3-4 tree data structure.
Implementation of all algorithms ConvexHull and ConcaveHull on C++
More C++
c++ implementation of 3D incremental convell hull algorthim
Algorithm for calculating a convex polygon around a pointcloud described by xy-Coordinates https://de.wikipedia.org/wiki/Graham_Scan
C++ implementation of 3 convex hull algorithms - Graham Scan, Jarvis March and Kirk Patrick Seidel along with Python wrapper for visualization
Improved version of real-time physics engine that couples FEM-based deformables and rigid body dynamics
Jarvis' March (Gift Wrapping) and Graham's Scan Algorithms for Computing Convex Hull
Add a description, image, and links to the convex-hull-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the convex-hull-algorithms topic, visit your repo's landing page and select "manage topics."