Geometry Processing Library for Python
-
Updated
Feb 11, 2024 - C++
Geometry Processing Library for Python
A lean C++ library for working with point cloud data
Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
c++ implementation of 3D incremental convell hull algorthim
1.算法与数据结构库;2.已经实现动态数组/双向链表/栈/队列/堆/链式哈希表/二叉搜索树/红黑树.均以C++模板类实现,可用于实际项目中替代STL的容器类及数据结构学习.3.已经实现图/深度优先/广度优先/单源最短路径/所有结点对最短路径/最小生成树/快速排序/归并排序/字符串匹配算法.可用于实际项目及算法学习.4.对分治/迭代算法设计方法进行总结,对动态规划/贪心算法针对几个经典问题做了具体实现.
C++ code for computing the convex hull of a polygon
Fast C++ multi-threaded algorithm for computing convex hulls
cpp implementation for algorithms in the book "digital image processing and computer vision"("数字图像处理与机器视觉-Visual C++与Matlab实现")
Linear separability (via planes) of two sets of 3D points
Implementation of all algorithms ConvexHull and ConcaveHull on C++
Surtr is a project that simulates dynamic object fracturing in real time with volumetric convex decomposition. Rendered with DX12.
C++ implementations of real time dynamic planar convex hull construction algorithms.
Implementation of Aggarwal's smallest circumscribing k-gon algorithm.
Amr-Tracker: [Computer Vision Project] is a program that detects Hands in a ROI (lower 2/3) of the frame, masks out the background using our color-space for the skin tone. After masking out, it draws its contours within our certain threshold to remove noise, and then draws the convex hull around the extreme points to have a better representation…
LiDAR processing ROS2. Segmentation: "Fast Ground Segmentation for 3D LiDAR Point Cloud Based on Jump-Convolution-Process". Clustering: "Curved-Voxel Clustering for Accurate Segmentation of 3D LiDAR Point Clouds with Real-Time Performance".
API for constructing Convex Hull, Triangulation of polygons and Delaunay triangulation of point sets.
The Astro Spiral project presents an innovative way to compare astronomical images of the sky by building a convex spiral (modification of the Graham Scan algorithm for convex hull) according to the bright objects in a photo. On that purpose, I made an application for Windows and Mac OS X, written in C++ that uses the Cinder toolbox.
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.
A Convex Hull algorithm implemented in C++. It's simple to read and understand and the complexity is O(N) when the points are sorted by one coordinate. The console app opens an image file, draws convex hull and creates an output image file.
My own implementation of classical computational geometry algorithms on diverse languages.
Add a description, image, and links to the convex-hull topic page so that developers can more easily learn about it.
To associate your repository with the convex-hull topic, visit your repo's landing page and select "manage topics."