Create heap_sort_color.py
This commit is contained in:
219
sort_color/heap_sort_color.py
Normal file
219
sort_color/heap_sort_color.py
Normal file
@@ -0,0 +1,219 @@
|
|||||||
|
import bpy
|
||||||
|
import random
|
||||||
|
import math
|
||||||
|
from array import *
|
||||||
|
from math import pi
|
||||||
|
import numpy as np
|
||||||
|
|
||||||
|
############################################################
|
||||||
|
# Heap Sort Algorithm
|
||||||
|
############################################################
|
||||||
|
|
||||||
|
def heapify(arr, n, i, seed):
|
||||||
|
|
||||||
|
global iframe
|
||||||
|
|
||||||
|
largest = i # Initialize largest as root
|
||||||
|
l = 2 * i + 1 # left = 2*i + 1
|
||||||
|
r = 2 * i + 2 # right = 2*i + 2
|
||||||
|
|
||||||
|
# See if left child of root exists and is
|
||||||
|
# greater than root
|
||||||
|
|
||||||
|
try:
|
||||||
|
#get materials during loop
|
||||||
|
mat1 = arr[largest].active_material.diffuse_color
|
||||||
|
mat2 = arr[l].active_material.diffuse_color
|
||||||
|
|
||||||
|
#get R value of both materials
|
||||||
|
r1 = mat1[0]
|
||||||
|
r2 = mat2[0]
|
||||||
|
|
||||||
|
#get G value of both materials
|
||||||
|
g1 = mat1[1]
|
||||||
|
g2 = mat2[1]
|
||||||
|
|
||||||
|
# R + G = value for comparison
|
||||||
|
rg1 = r1 + g1
|
||||||
|
rg2 = r2 + g2
|
||||||
|
except:
|
||||||
|
print("l to big")
|
||||||
|
|
||||||
|
if l < n and rg1 < rg2:
|
||||||
|
largest = l
|
||||||
|
|
||||||
|
# See if right child of root exists and is
|
||||||
|
# greater than root
|
||||||
|
|
||||||
|
try:
|
||||||
|
#get materials during loop
|
||||||
|
mat1 = arr[largest].active_material.diffuse_color
|
||||||
|
mat2 = arr[r].active_material.diffuse_color
|
||||||
|
|
||||||
|
#get R value of both materials
|
||||||
|
r1 = mat1[0]
|
||||||
|
r2 = mat2[0]
|
||||||
|
|
||||||
|
#get G value of both materials
|
||||||
|
g1 = mat1[1]
|
||||||
|
g2 = mat2[1]
|
||||||
|
|
||||||
|
# R + G = value for comparison
|
||||||
|
rg1 = r1 + g1
|
||||||
|
rg2 = r2 + g2
|
||||||
|
except:
|
||||||
|
print("r to big")
|
||||||
|
|
||||||
|
if r < n and rg1 < rg2:
|
||||||
|
largest = r
|
||||||
|
|
||||||
|
# Change root, if needed
|
||||||
|
if largest != i:
|
||||||
|
arr[i], arr[largest] = arr[largest], arr[i] # swap
|
||||||
|
|
||||||
|
a = arr[i].location.x
|
||||||
|
b = arr[largest].location.x
|
||||||
|
|
||||||
|
arr[i].location.x = b
|
||||||
|
arr[largest].location.x = a
|
||||||
|
|
||||||
|
for cube in Matrix[seed]:
|
||||||
|
cube.keyframe_insert(data_path="location", frame=iframe)
|
||||||
|
|
||||||
|
iframe += 1
|
||||||
|
|
||||||
|
# Heapify the root.
|
||||||
|
heapify(arr, n, largest, seed)
|
||||||
|
|
||||||
|
# The main function to sort an array of given size
|
||||||
|
def heap_sort(arr, seed):
|
||||||
|
|
||||||
|
n = len(arr)
|
||||||
|
|
||||||
|
global iframe
|
||||||
|
|
||||||
|
# Build a maxheap.
|
||||||
|
for i in range(n//2 - 1, -1, -1):
|
||||||
|
heapify(arr, n, i, seed)
|
||||||
|
|
||||||
|
# One by one extract elements
|
||||||
|
for i in range(n-1, 0, -1):
|
||||||
|
arr[i], arr[0] = arr[0], arr[i] # swap
|
||||||
|
|
||||||
|
a = arr[i].location.x
|
||||||
|
b = arr[0].location.x
|
||||||
|
|
||||||
|
arr[i].location.x = b
|
||||||
|
arr[0].location.x = a
|
||||||
|
|
||||||
|
for cube in Matrix[seed]:
|
||||||
|
cube.keyframe_insert(data_path="location", frame=iframe)
|
||||||
|
|
||||||
|
iframe += 1
|
||||||
|
|
||||||
|
heapify(arr, i, 0, seed)
|
||||||
|
|
||||||
|
############################################################
|
||||||
|
# Setup Random Colors + Array to be sorted
|
||||||
|
############################################################
|
||||||
|
|
||||||
|
def setup_array(count):
|
||||||
|
|
||||||
|
#fill array with numbers between 0 & count - 1
|
||||||
|
index = list(range(count))
|
||||||
|
|
||||||
|
#initialize 2d array
|
||||||
|
Matrix = [[0 for x in range(count)] for y in range(count)]
|
||||||
|
|
||||||
|
#initialize plane array
|
||||||
|
planes = [0 for i in range(count*count)]
|
||||||
|
|
||||||
|
#initialize material array
|
||||||
|
materials = [0 for i in range(count)]
|
||||||
|
|
||||||
|
#create arrays for each color value (RGB) to generate the sunset gradient
|
||||||
|
|
||||||
|
#first half 0 --> 254, second half 255 --> 255
|
||||||
|
colors_r = [0 for i in range(count)]
|
||||||
|
colors_r1 = np.linspace(0, 254, count//2)
|
||||||
|
colors_r2 = np.linspace(255, 255, count//2)
|
||||||
|
for i in range(count):
|
||||||
|
if(i < count//2):
|
||||||
|
colors_r[i]=colors_r1[i]
|
||||||
|
else:
|
||||||
|
colors_r[i]=colors_r2[i-count//2]
|
||||||
|
|
||||||
|
#first half 0 --> 0, second half 10 --> 200
|
||||||
|
colors_g = [0 for i in range(count)]
|
||||||
|
colors_g1 = np.linspace(0, 0, count//2)
|
||||||
|
colors_g2 = np.linspace(10, 200, count//2)
|
||||||
|
for i in range(count):
|
||||||
|
if(i < count//2):
|
||||||
|
colors_g[i]=colors_g1[i]
|
||||||
|
else:
|
||||||
|
colors_g[i]=colors_g2[i-count//2]
|
||||||
|
|
||||||
|
#first half 200 --> 0, secondhalf 10 --> 100
|
||||||
|
colors_b = [0 for i in range(count)]
|
||||||
|
colors_b1 = np.linspace(255, 0, count//2)
|
||||||
|
colors_b2 = np.linspace(10, 100, count//2)
|
||||||
|
for i in range(count):
|
||||||
|
if(i < count//2):
|
||||||
|
colors_b[i]=colors_b1[i]
|
||||||
|
else:
|
||||||
|
colors_b[i]=colors_b2[i-count//2]
|
||||||
|
|
||||||
|
#delete every existing object
|
||||||
|
for ob in bpy.data.objects:
|
||||||
|
bpy.data.objects.remove(ob)
|
||||||
|
|
||||||
|
#delete all existing materials
|
||||||
|
for material in bpy.data.materials:
|
||||||
|
bpy.data.materials.remove(material, do_unlink=True)
|
||||||
|
|
||||||
|
#creating count * count planes with location.x = j * 2 and location.z = i * 2
|
||||||
|
for i in range(count):
|
||||||
|
for j in range(count):
|
||||||
|
bpy.ops.mesh.primitive_plane_add(location=(j*2, 0, i*2), rotation=(pi / 2, 0, 0), scale=(0.1, 0.1, 0.1))
|
||||||
|
|
||||||
|
#adding all planes to an array
|
||||||
|
i=0
|
||||||
|
for ob in bpy.data.objects:
|
||||||
|
planes[i]= ob
|
||||||
|
i+=1
|
||||||
|
|
||||||
|
#sorts list of all objects based primary on their location.x and secondary on their location.z
|
||||||
|
planes.sort(key = lambda obj: obj.location.z + obj.location.x/(count*count))
|
||||||
|
|
||||||
|
#adding materials to array and set colorgradient
|
||||||
|
for i in range(count):
|
||||||
|
for j in range(count):
|
||||||
|
material = bpy.data.materials.new(name="")
|
||||||
|
material.diffuse_color = (colors_r[i], colors_g[i], colors_b[i], 255)
|
||||||
|
materials[i] = material
|
||||||
|
|
||||||
|
#add materials to planes and planes to 2d array
|
||||||
|
for i in range(count):
|
||||||
|
#randomize distribution of colors for every row
|
||||||
|
random.shuffle(materials)
|
||||||
|
for j in range(count):
|
||||||
|
planes[j+i*count].data.materials.append(materials[j]) #add the material to the object
|
||||||
|
Matrix[i][j] = planes[j+i*count]
|
||||||
|
|
||||||
|
#set optimal color managment setting
|
||||||
|
bpy.context.scene.view_settings.exposure = -3.75
|
||||||
|
bpy.context.scene.view_settings.gamma = 0.7
|
||||||
|
bpy.context.scene.view_settings.look = 'Medium Contrast'
|
||||||
|
|
||||||
|
return(Matrix, count)
|
||||||
|
|
||||||
|
############################################################
|
||||||
|
# Call Functions
|
||||||
|
############################################################
|
||||||
|
|
||||||
|
Matrix, count = setup_array(50)
|
||||||
|
|
||||||
|
#quick_sort every array
|
||||||
|
for i in range(count):
|
||||||
|
iframe= 0
|
||||||
|
heap_sort(Matrix[i], i)
|
||||||
Reference in New Issue
Block a user