Hang in asiAlgo_QuickHull2d
This class builds convex hull in 2d using divide and conquer paradigm; like many other convex hull construction algorithms it relies on finding one or more points to be in hull.
The block below finds initial points incorrectly:
if ( x < xMin )
{
xMin = x;
p_left_idx = p_idx;
}
if ( x > xMax )
{
xMax = x;
p_right_idx = p_idx;
}
It should use lexicographic sort instead of sorting on one coordinate.
In a result, this leads to hang.