学会了斐波那契数之后,就能利用它们制造出一些好看的图案,比如说今天要说的银杏树
import turtle
import random
from math import *
其中的*代表的是所有内容,math就是数学的包
print(turtle.heading())
def Fibonacci_Recursion_tool(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return Fibonacci_Recursion_tool(n - 1) + Fibonacci_Recursion_tool(n - 2)
def Fibonacci_Recursion(n):
result_list = []
for i in range(1, n + 3):
result_list.append(Fibonacci_Recursion_tool(i))
return result_list
yu = Fibonacci_Recursion(10)
print(yu)
这段代码详细介绍请见《两种生成斐波那契数的方法》其一
def leaf(x, y, node):
til = turtle.heading()
i = random.random()
an = random.randint(10, 180)
ye = random.randint(6, 9)/10
turtle.color(ye, ye*0.9, 0)
这里又用到了RGB,详细请见《用Turtle绘制斐波那契数列彩色螺旋线》中绘制颜色
银杏树在人们印象中普遍呈金黄色,所以RGB中的B(Blue)就为0(物理中学到光的三原色后,红光和绿光能合成黄光,黄色就是银杏树树叶的颜色)
turtle.fillcolor(ye+0.1, ye+0.05, 0)
turtle.pensize(1)
turtle.pendown()
turtle.setheading(an + 90)
turtle.forward(8*i)
这里的setheading就是设置笔的方向
px = turtle.xcor()
py = turtle.ycor()
turtle.begin_fill()
turtle.circle(7.5*i, 120)
turtle.penup()
turtle.goto(px, py)
turtle.setheading(an + 90)
turtle.pendown()
turtle.circle(-7.5*i, 120)
turtle.setheading(an + 100)
turtle.circle(10.5*i, 150)
turtle.end_fill()
turtle.penup()
turtle.goto(x, y)
turtle.setheading(til)
turtle.pensize(node / 2 + 1)
画银杏叶
先画一条150度的大弧线
这是一张银杏叶的图片,可以明显看出下部的收尾是两个圆弧,也就是说,银杏叶由一个大圆弧和两个小圆弧组成,所以下一步就是要画出两条120度的小弧线。
这段函数是在定义画叶子的方法
def draw(node, length, level, yu, button):
turtle.pendown()
t = cos(radians(turtle.heading()+5)) / 8 + 0.25
turtle.pencolor(t*1.6, t*1.2, t*1.4)
turtle.pensize(node/1.2)
x = random.randint(0, 10)
pencolor是RGB颜色,最后的random就是随机数,随机的是决定要画树枝还是叶子。
if level == top and x > 6:
top在最结尾,用于控制树的高度,这里要画树叶,而x如果范围过大会导致树太秃
turtle.forward(length)
yu[level] = yu[level] - 1
c = random.randint(2, 10)
for i in range(1, c):
leaf(turtle.xcor(), turtle.ycor(), node)
if random.random() > 0.3:
turtle.penup()
yu在结尾,level在上方。如果随机数大于0.3,则需要抬笔,否则可能会出现连线
t1 = turtle.heading()
print("turtle.heading()",t1)# 可以用print看一下t1的值。
an1 = -40 + random.random() * 40 #random.random()产生0,1之间的浮点数
turtle.setheading(an1)
dis = int(800 * random.random() * 0.5 + 400 * random.random() * 0.3 + 200 * random.random() * 0.2)
#上面的800 * random.random() * 0.5是
turtle.forward(dis)
turtle.setheading(t1)
turtle.right(90)
# 画叶子
leaf(turtle.xcor(), turtle.ycor(), node)
turtle.left(90)
# 返回
t2 = turtle.heading()
turtle.setheading(an1)
turtle.backward(dis)
turtle.setheading(t2)
elif level==top and x < 7 : #此时画枝叶,x范围太大会导致飘落的叶子太少
turtle.penup()
turtle.forward(length)
elif level>3 and x>6 :#三级树枝以上,有40%的概率执行以下策略
turtle.pendown()
turtle.forward(length)
c = random.randint(4, 6)
for i in range(3, c):
leaf(turtle.xcor(), turtle.ycor(),node)
leaf(turtle.xcor(), turtle.ycor(),node)
#button=1
else:
turtle.forward(length) # 画树枝
yu[level] = yu[level] -1
if node > 0 and button == 0:
# 计算右侧分支偏转角度,在固定角度偏转增加一个随机的偏移量
right = random.random() * 5 + 17
# 计算左侧分支偏转角度,在固定角度偏转增加一个随机的偏移量
left = random.random() * 20 + 19
# 计算下一级分支的长度
child_length = length * (random.random() * 0.25 + 0.7)
# 右转一定角度,画右分支
r=random.randint(0, 1)
if r==1:
turtle.right(right)
level = level + 1
#print("level", level)
else:
turtle.left(right)
level = level + 1
#print("level", level)
draw(node - 1, child_length,level,yu,button) #递归调用自己。
yu[level] = yu[level] +1
if yu[level] > 1:
# 左转一定角度,画左分支
if r==1:
turtle.left(right + left)
draw(node - 1, child_length, level, yu,button)
# 将偏转的角度,转回
turtle.right(left)
yu[level] = yu[level] - 1
else:
turtle.right(right + left)
draw(node - 1, child_length, level, yu,button)
# 将偏转的角度,转回
turtle.left(left)
yu[level] = yu[level] - 1
else:
if r==1:
turtle.left(right + left)
turtle.right(left)
else:
turtle.right(right + left)
turtle.left(left)
turtle.penup()
#退回到上一级节点顶部位置
turtle.backward(length)
if __name__ == '__main__':
turtle.setup(width=1.0, height=1.0)
turtle.hideturtle()
turtle.speed(0)
turtle.penup()
turtle.left(90)
turtle.backward(300)
top = 8
yu = Fibonacci_Recursion(top)
yu.remove(yu[0])
print(yu)
button = 0
draw(top, 120, 0, yu, button)
turtle.write("(名字)", font=("微软雅黑", 14, "normal"))
turtle.done()
最终生成并签名