Index : Eulerian path Generators

Generated Points

Ovoid

Steps

Polygon

Number of sides
Random variation +/- %

Double Polygon

Number of sides
Outer radius
Middle radius
Inner radius
Shift Middle
Shift Inner
Random variation +/- %

Nested Polygons

Number of sides
Random variation +/- %
Number of iterations
Attachment proportion (0 - 1)

Triangular Mesh

Size
Corners

Quad Mesh

Size	Width Height Border
Corners

Star Mesh

Computes intersections of lines from vertex i to vertex i + 2 to create a graph solved by Hierholzer

Size	sides random pc Border

Simple Star

Connecting vertex i to vertex i + (side separation) - complete if sides and side_separation are relatively prime or
use Hierholzer to make a fully connected star

Size	sides side separation random pc Border fully connected (if sides odd)

cardioid

Connecting vertex i to vertex 2*i mod sides - complete if sides is a primitive root of 2 see Sequence A167791

Size	sides Border

Circles

Path	step size degrees. required steps per segment computed steps per segment
Grid Form	Columns rows radius separation
Polygon Form	#sides polygon radius circle separation inscribed circle inscribed radius
Specified form	#n circles
Circle 1	radius centre
Circle 2	radius centre
Circle 3	radius centre
Circle 4	radius centre
Circle 5	radius centre
Circle 6	radius centre

Linked Circles

Path	step size degrees.
Specified form	#n circles
Circle 1	radius centre
Circle 2	radius centre

Knight's tour

size n - board is n x n	Border
Tour	an array of arrays of order position in the tour [ [56,53,12,5,44,51,14,17], [11,6,55,52,13,16,45,50], [54,57,4,9,48,43,18,15], [3,10,7,24,31,46,49,42], [58,33,30,47,8,23,26,19], [63,2,61,32,25,20,41,38], [34,59,64,29,36,39,22,27], [1,62,35,60,21,28,37,40] ]

Hierholzer test

Edges	An array of edges as pairs of node numbers with node numbers from 0 upwards [[0,1],[1,2],[2,0]]
	Stable? Number of edges : unknown Number of duplicate edges added : unknown Number of nodes : unknown
Duplicate Edges
Nodes	An array of [x,y] nodes : Jitter %
Start node
	Stable? Path length : unknown
Path
Gap lengths
Min Gap	unknown
Points

Non-eulerian forms

Number of sides
Width
inner as % of outer
outer phase angle
Make Graph and copy to Hierholzer

Infill

Perimeter - Polygon	sides sides per strut
Outer	Radius
inner	inset