RPG - Random Polygon Generator

rpg was originally presented in Auer and Held (CCCG’96).

rpg implements various algorithms to generate polygons described in that paper, such as Quick Star, Steady Growth, Space Partitioning, and 2-opt Moves.

Furthermore, its xmono backend implements Zhu et al’s (CGTA 1996) algorithm for generating x-monotone polygons, and triangle generates polygons by searching for feasible edges within a random triangulation of the vertices.

rpg can also produce polygons with holes and smooth sharp corners; please see rpg’s readme.