Incremental convex hull

[mynickmynick]

Could you please suggest a way (on the C interface usable by PCL) to update the convex hull of a set adding one point at a time?
The reason is that I am experimenting a conditional clustering, where on each candidate growing cluster point I impose conditions on the convex hull and area.
So what I would need is something conceptually like

convex_hull(n)=convex_hull_incremental( convex_hull(n-1) , point(n))
where the algorithm convex_hull_incremental exploits the fact that convex_hull(n-1) is already convex to calculate faster the result

right now I am using

convex_hull(n)=convex_hull[ list_union( convex_hull(n-1) , point(n))]
where I don't exploit it and the calculation is of course slow

thanks

[pranavmalikk]

Really curious about this as well

[cbbarber]

You can use qh_addpoint in llibqhull_r.c to add a point. qh_addpoint requires a facet that is clearly below the point (e.g., qh_findbestfacet in poly2_r.c).

This is a slow method to compute the convex hull with Qhull. qh_findbestfacet often requires testing most of the existing facets
http://www.qhull.org/html/qh-faq.htm#inc