Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
-
Updated
Oct 18, 2022 - C
Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
Computed nearest neighbors and plotted convex hull on Google earth using PostGIS spatial database
Gift Wrap and Incremental Algorithm for the calculation of convex hull. Also, algorithm that finds the lattice points of a circle.
Computational Geometry Assignments for CS F402 at BPHC 2020-2021 session Semester 1.
Add a description, image, and links to the convex-hulls-finding topic page so that developers can more easily learn about it.
To associate your repository with the convex-hulls-finding topic, visit your repo's landing page and select "manage topics."