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
An Unity package, enabling user to generate shapes by scripting.
Data clustering algorithm based on agglomerative hierarchical clustering (AHC) which uses minimum volume increase (MVI) and minimum direction change (MDC) clustering criteria.
Hand-detection-and-finger-counter using opencv
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.
3D convex hull (quickhull) algorithm in Go
A Python implementation of Chan's Algorithm for lower convex hull in 3D.
Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
This repository is a MATLAB version of hyperplane shifting algorithm that can be used to represent available wrench set facets
Contains the codes and reports that were done as a part of the ED5310: Algorithms in Computational Geometry
Apply OCR to recognize the sixteen digits on the credit card.
2D Particle & Convex Hull & Text Generation Experiment for 'Plastic Sarira.
Using the devide and conquer way to find the convexhull
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."