MohamedNagyMostafa/Dragon.Curve.libGDX-problem.solving-

A dragon curve is any member of a family of self-similar fractal curves, which can be approximated by recursive methods such as Lindenmayer systems.

★ 0Forks 0JavaGitHub ↗Compare
algorithmsdragon-curvedrawingjavalibgdxproblem-solvingrecursive-algorithm

README

Dragon Curve

This is an algorithm for drawing "Dragon Curve" using libGDX.

Dragon curve : rotate the previous shap with 90 angle for each order.

Example :-

Dragon curve

Order one.

1

Order two.

2

Order three.

3

Order ten.

4

Contributors

MohamedNagyMostafa

Issues