File tree Expand file tree Collapse file tree 1 file changed +6
-4
lines changed Expand file tree Collapse file tree 1 file changed +6
-4
lines changed Original file line number Diff line number Diff line change @@ -2820,13 +2820,15 @@ def permutation_matrices(n):
2820
2820
qinds = np .arange (qc )
2821
2821
rinds = np .arange (rc )
2822
2822
2823
+ square_rot = square .dot (permute .T )
2824
+
2823
2825
for p in pinds :
2824
2826
for q in qinds :
2825
2827
# draw lower faces
2826
2828
p0 = permute .dot ([p , q , 0 ])
2827
2829
i0 = tuple (p0 )
2828
2830
if filled [i0 ]:
2829
- boundary_found (p0 + square . dot ( permute . T ) , color [i0 ])
2831
+ boundary_found (p0 + square_rot , color [i0 ])
2830
2832
2831
2833
# draw middle faces
2832
2834
for r1 , r2 in zip (rinds , rinds [1 :]):
@@ -2837,16 +2839,16 @@ def permutation_matrices(n):
2837
2839
i2 = tuple (p2 )
2838
2840
2839
2841
if filled [i1 ] and not filled [i2 ]:
2840
- boundary_found (p2 + square . dot ( permute . T ) , color [i1 ])
2842
+ boundary_found (p2 + square_rot , color [i1 ])
2841
2843
elif not filled [i1 ] and filled [i2 ]:
2842
- boundary_found (p2 + square . dot ( permute . T ) , color [i2 ])
2844
+ boundary_found (p2 + square_rot , color [i2 ])
2843
2845
2844
2846
# draw upper faces
2845
2847
pk = permute .dot ([p , q , rc - 1 ])
2846
2848
pk2 = permute .dot ([p , q , rc ])
2847
2849
ik = tuple (pk )
2848
2850
if filled [ik ]:
2849
- boundary_found (pk2 + square . dot ( permute . T ) , color [ik ])
2851
+ boundary_found (pk2 + square_rot , color [ik ])
2850
2852
2851
2853
return polygons
2852
2854
You can’t perform that action at this time.
0 commit comments