-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmandala.py
More file actions
180 lines (145 loc) · 4.58 KB
/
mandala.py
File metadata and controls
180 lines (145 loc) · 4.58 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
#!/usr/bin/python
#
# Copyright 2007-2010 Fritz Obermeyer
#
# This program 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 of the License, or
# (at your option) any later version.
#
# This program 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 program. If not, see <http://www.gnu.org/licenses/>.
from exceptions import Exception
from math import *
from pyx import *
density = 20
barwidth = 0.333
_log_2 = log(2)
log2 = lambda x: log(x) / _log_2
heapHash = lambda x: log2(2 * x + 1)
c = canvas.canvas()
left = lambda n: 2 * n
right = lambda n: 2 * n + 1
def polar2cart(r, a):
rho = r
return rho * cos(2 * pi * a), rho * sin(2 * pi * a)
def pointPos(n):
t = log2(2 * n + 1)
return polar2cart(t, t)
pointSize = lambda n: 0.5 * (1.0 - barwidth) * (1.0 - exp(-4.0 * sqrt(2.0) * heapHash(n) / n))
# ==========[ drawing the Nodes ]==========
def drawNodes(depth):
N = 2 ** depth
for n in range(1, N + 1):
x, y = pointPos(n)
r = pointSize(n)
c.stroke(path.circle(x, y, r), [style.linewidth(r / 6.0)])
# ==========[ drawing the archimedian spiral ]==========
def drawSpiral(depth):
# define times
secants = 6 * density
times = [(1.0 * n) / secants for n in range(secants * (depth + 1) + 1)]
# draw points
p = path.path(path.moveto(0, 0))
for t in times:
x, y = polar2cart(t, t)
p.append(path.lineto(x, y))
c.stroke(p, [style.linewidth(barwidth), color.rgb(0.9, 0.9, 0.9)])
# ==========[ drawing the tree ]==========
sinkLeft = lambda t0, t: log2(2 * t0 * 2 ** t + 1)
sinkRight = lambda t0, t: log2(2 * ((t0 + 1) * 2 ** t - 1) + 1)
def drawLeftBranch(n, depth):
# define times
times = [0.0]
multiplier = 2.0 ** (0.4 / density)
while times[-1] < depth:
times.append(min(depth, (n + times[-1]) * multiplier - n))
for t in range(1, depth):
times.append(float(t))
times.sort()
# draw points
t = times[0]
s = sinkLeft(n, t)
x, y = polar2cart(s, s - t)
p = path.path(path.moveto(x, y))
for t in times:
s = sinkLeft(n, t)
x, y = polar2cart(s, s - t)
p.append(path.lineto(x, y))
c.stroke(p, [color.rgb.blue])
def drawLeftBranch_alt(n, depth):
x, y = pointPos(n)
p = path.path(path.moveto(x, y))
for t in range(depth):
n = left(n)
x, y = pointPos(n)
p.append(path.lineto(x, y))
c.stroke(p, [color.rgb.blue])
def drawRightBranch(n, depth):
# define times
times = [0.0]
multiplier = 2.0 ** (0.4 / density)
while times[-1] < depth:
times.append(min(depth, (n + times[-1]) * multiplier - n))
for t in range(1, depth):
times.append(float(t))
times.sort()
# draw points
t = times[0]
s = sinkRight(n, t)
x, y = polar2cart(s, s - t)
p = path.path(path.moveto(x, y))
for t in times:
s = sinkRight(n, t)
x, y = polar2cart(s, s - t)
p.append(path.lineto(x, y))
c.stroke(p, [color.rgb.red])
def drawRightBranch_alt(n, depth):
x, y = pointPos(n)
p = path.path(path.moveto(x, y))
for t in range(depth):
n = right(n)
x, y = pointPos(n)
p.append(path.lineto(x, y))
c.stroke(p, [color.rgb.red])
def fillTree(n, depth):
if depth > 1:
drawRightBranch(left(n), depth - 1)
fillTree(left(n), depth - 1)
drawLeftBranch(right(n), depth - 1)
fillTree(right(n), depth - 1)
def drawTree(n, depth):
drawLeftBranch(n, depth)
drawRightBranch(n, depth)
fillTree(n, depth)
# ==========[ drawing the hook ]==========
def drawHook():
# define times
N = 10
secants = 6 * density
times = [-float(n) / secants for n in range(N * secants)]
# draw points
t = times[0]
s = sinkLeft(1, t)
x, y = polar2cart(s, s - t)
p = path.path(path.moveto(x, y))
for t in times:
s = sinkLeft(1, t)
x, y = polar2cart(s, s - t)
p.append(path.lineto(x, y))
c.stroke(p, [color.rgb.blue])
# ==========[ drawing the mandala ]==========
def drawMandala(depth):
drawSpiral(depth)
drawTree(1, depth)
drawHook()
drawNodes(depth)
c.stroke(path.circle(0, 0, depth + 3))
c.writetofile('mandala.pdf')
if __name__ == '__main__':
drawMandala(10)