Builtin Library
README.md
pathNetwork.procedural
Rules that lay out a path network as a plan ({ nodes, edges }), which
pathNetwork.fromPlan or net:addPlan builds. The same seed lays out the
same network.
| Rule | |
|---|---|
connect(places, { loops?, meander?, spacing?, seed? }) | Join a set of places with the shortest tree reaching all of them, plus loops extra links between near neighbours that cross no other link; meander pushes the links sideways by up to that many metres. |
grid({ cols?, rows?, spacing?, origin?, jitter?, seed? }) | A grid of streets, each crossing joined to its neighbours. |
circuit({ origin?, radius?, radiusZ?, count?, wander?, pointsPerEdge?, seed? }) | A closed circuit of count nodes round an ellipse whose radius wanders. |