A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
-
Updated
Feb 25, 2022 - C
A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
fast layer decomposition and updating
Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
An Unity package, enabling user to generate shapes by scripting.
3D convex hull (quickhull) algorithm in Go
Implementation of all algorithms ConvexHull and ConcaveHull on C++
Data clustering algorithm based on agglomerative hierarchical clustering (AHC) which uses minimum volume increase (MVI) and minimum direction change (MDC) clustering criteria.
Implementation of the S-Hull Delaunay triangulation algorithm in Stata. The Convex Hull is generated as a residual. The Voronoi are recovered as a dual to the Delaunay.
Apply OCR to recognize the sixteen digits on the credit card.
Hand-detection-and-finger-counter using opencv
A Python implementation of Chan's Algorithm for lower convex hull in 3D.
Using the devide and conquer way to find the convexhull
A convex hull implementation based on the paper by Wijeweera & Pinidiyaarachchi
A simple convex hull algorithm visualization.
Contains the codes and reports that were done as a part of the ED5310: Algorithms in Computational Geometry
Add a description, image, and links to the convexhull topic page so that developers can more easily learn about it.
To associate your repository with the convexhull topic, visit your repo's landing page and select "manage topics."