Visualization of the triangle algorithm
- The idea is to test if a given point p is in the convex hull of a given set of points v_1, ..., v_n.
- Select the points by clicking in the square, then select p. Next select an agent, p'. p' keeps changing its position to come closer and closer to p.
- Or it determines that p is outside in which case places a perpendicular line at the midpoint of line p'p.