Randomized Incremental Convex Hull is Highly Parallel - YouTube
Efficient 3D Convex Hull Tutorial - Codeforces
Algorithm 1. (Convex Hull) - Pseudo code - Input. A set of points in the plane. Output. A list containing the vertices of Conv ( P). 1. Sort the points. - ppt download
Convex hull in 3D | PPT
c++ - Get the horizon for a point during incremental Convex Hull 3D - Stack Overflow
PDF) An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points
Convex Hull Algorithms in 2D. Helena(Yuhan) Shangguan, Zihan Miao… | by Zihan Miao | Smith-HCV | Medium
PDF) An Efficient Planar Incremental Convex Hull Algorithm to Find the Edges of the Boundary Polygon of the Convex Hull of a Set of Points | Kasun Ranga Wijeweera - Academia.edu
A Total Order Heuristic-Based Convex Hull Algorithm for Points in the Plane - ScienceDirect
Covex hull algorithms in 3D
Designing and proving correct a convex hull algorithm with hypermaps in Coq - ScienceDirect
incremental 3D convex hull « HIDIHO!
Convex Hull Algorithms in 2D. Helena(Yuhan) Shangguan, Zihan Miao… | by Zihan Miao | Smith-HCV | Medium