Convex Hull

Implements a sweep-line algorithm for identifying convex hulls in a SELES spatial model. A single worker agent traverses the landscape starting from the top-right-most point, walking the boundary line to each new vertex and erasing interior cells until a new pivot vertex is hit — progressively marking the hull boundary. Illustrates how SELES agents can execute geometric computational tasks across rasterized landscapes.

Adapted from the SELES wiki.