Our implementation fpg is based on the approach originally proposed by O’Rourke and Virmani. Given a regular polygon P, its vertices are translated in the plane...

The code make_hilbert generates instances of (closed) Hilbert curves. Source code is available on github.

See /db/wip/polygons/contrived/hilbert/ for polygons.

h00000072...

The code make_koch_snowflake generates instances of Koch’s snowflake curve, optionally in a nested variant, and make_koch_snowflake_quad generates instances of Koch’s rectilinear...

The code make_lebesgue generates instances of (closed) Lebesgue curves. All vertices have integer coordinates. Source code is available on github.

See...

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...

The code make_sierpinski generates instances of Sierpinski curves. All vertices have integer coordinates. Source code is available on github.

See...

The spg (simple polygon generator) code constructs a simple polygon P on a given point set S in the plane. Initially, spg creates a (not necessarily simple)...

srpg generates simply-connected and multiply-connected polygons by means of a regular grid (with quadratic cells). Source code is available on github.

See the...