by Omar Saad (IREQ), Eric Ouellet
Ouellet Convex Hull is currently the only ‘Online’ Convex Hull in O(log h) per point, where 'Online' stands for dynamically add one point at a time. Based on our own test against many other algorithm implementations, including Chan and Voronoi/Delaunay, it appears to be the fastest one.
by John Jiyang Hou
An algorithm to determine if a point is inside a 3D convex polygon for a given polygon vertices in C++
