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.
Distance Surface
Demonstrates a distance-propagation algorithm that calculates the minimum distance from any cell to a source layer (e.g. roads or streams). The technique spreads outward from source locations in a wave-like pattern, with each cell storing both its distance from source and the nearest source location — an example of spatial analysis through iterative neighbourhood spreading.
Filter Small
Demonstrates a spatial clustering technique that identifies and removes small patches from a landscape: it locates patches of a specified type, measures their size in cells, and marks those below a threshold (100 cells) for filtering. An example of using landscape events and spatial variables for targeted landscape analysis and modification.
LSStats
A landscape statistics model demonstrating how to implement landscape ecology metrics within SELES: it identifies spatial patches, calculates fragmentation indices (patch size distribution, edge metrics, core area statistics), and computes connectivity measures via nearest-neighbour analysis and minimum spanning trees. An example of a custom stats event that can be adapted for specific research questions about landscape composition and configuration.