#!/usr/bin/ucblogo
; Copyright 2012, 2013, 2014, 2015 Kevin Ryde
;
; This file is free software; you can redistribute it and/or modify it
; under the terms of the GNU General Public License as published by the Free
; Software Foundation; either version 3, or (at your option) any later
; version.
;
; This file is distributed in the hope that it will be useful, but
; WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
; or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
; for more details.
;
; You should have received a copy of the GNU General Public License along
; with this file. If not, see .
; Usage: ucblogo dragon.logo
;
; Plot the dragon curve using bit-twiddling to turn the turtle left or
; right, as described for example in "Turn" of
; Math::PlanePath::DragonCurve and variously elsewhere.
;
; The commented out "dragon.chamfer 256" is an alternative plot with
; the corners rounded off to help see the shape.
;
;
; See also:
;
; Mark Horney,
; "Fractals I: Making Recursion Visible", Logo Exchange, Volume 9,
; number 1, September 1990, pages 23-29.
; "Fractals II: Representation", Logo Exchange, Volume 9, number 2,
; October 1990, pages 26-29.
; "Fractals III: Monsters of Mathematics", Logo Exchange, Volume 9,
; number 3, November 1990, pages 28-31
; http://el.media.mit.edu/logo-foundation/pubs/nlx.html
; http://el.media.mit.edu/logo-foundation/pubs/nlx/v9/Vol9No1.pdf
; http://el.media.mit.edu/logo-foundation/pubs/nlx/v9/Vol9No2.pdf
; http://el.media.mit.edu/logo-foundation/pubs/nlx/v9/Vol9No3.pdf
; Extract articles from the full files with
; qpdf Vol9No1.pdf --pages Vol9No1.pdf 1,25-31 -- Vol9No1--fractals-I.pdf
; qpdf Vol9No2.pdf --pages Vol9No2.pdf 33-36 -- Vol9No2--fractals-II.pdf
; qpdf Vol9No3.pdf --pages Vol9No3.pdf 30-33 -- Vol9No3--fractals-III.pdf
; Return the bit above the lowest 1-bit in :n.
; If :n = binary "...z100..00" then the return is "z000..00".
; Eg. n=22 is binary 10110 the lowest 1-bit is the "...1." and the return is
; bit above that "..1.." which is 4.
to bit.above.lowest.1bit :n
output bitand :n (1 + (bitxor :n (:n - 1)))
end
; Return angle +90 or -90 for dragon curve turn at point :n.
; The curve is reckoned as starting from n=0 so the first turn is at n=1.
to dragon.turn.angle :n
output ifelse (bit.above.lowest.1bit :n) = 0 [90] [-90]
end
; Draw :steps many segments of the dragon curve.
to dragon :steps
localmake "step.len 12 ; length of each step
repeat :steps [
forward :step.len
left dragon.turn.angle repcount ; repcount = 1 to :steps inclusive
]
end
; Draw :steps many segments of the dragon curve, with corners chamfered
; off with little 45-degree diagonals.
; Done this way the vertices don't touch.
to dragon.chamfer :steps
localmake "step.len 12 ; length of each step
localmake "straight.frac 0.5 ; fraction of the step to go straight
localmake "straight.len :step.len * :straight.frac
localmake "diagonal.len (:step.len - :straight.len) * sqrt(1/2)
repeat :steps [
localmake "turn (dragon.turn.angle repcount)/2 ; +45 or -45
forward :straight.len
left :turn
forward :diagonal.len
left :turn
]
end
; little circle to show the origin
arc 360 3
; initial direction East
setheading 90
dragon 256
; dragon.chamfer 256
print "Press\ return\ to\ exit
localmake "line readlist
bye