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.
Order two.
Order three.
Order ten.
-
Notifications
You must be signed in to change notification settings - Fork 0
MohamedNagyMostafa/Dragon.Curve.libGDX-problem.solving-
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published