A letter scrambling and object constancy demo based on Mike Bostock's General Update Pattern III.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import copy | |
# fun from Ernest! | |
# | |
# Given two strings s and t, determine whether some anagram of t is a substring of s. | |
# For example: if s = "udacity" and t = "ad", then the function returns True. | |
# Your function definition should look like: question1(s, t) and return a boolean True or False. | |
def q_mike(s, t): | |
def add_to_hist(c, hist): |
10,000 poisson-disc samples of Van Gogh’s The Starry Night. Compare to uniform random samples.
Forked from Poisson-Disc III