zpconn

## README.md

      
              3 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                zpconn
                / README.md
            
            
              Last active
              August 29, 2015 14:00
            
              
                Spherical alpha shapes
              
          
    This example demonstrates spherical alpha shapes in the orthographic projection. An alpha shape is a generalized concave hull which seeks to characterize the "shape" of a set of points on a surface. It is obtained here by computing the (spherical) Delaunay triangulation (accomplished with the aid of an excellent script from Jason Davies), stripping out triangles that are "too big", and then merging the resulting mesh to remove excess interior geometry that remains from the triangulation.

  
## reservoir_max.py
import random

def rand_max(arr):
	curr_max = 0
	curr_max_idx = 0
	curr_max_count = 1
	for i,x in enumerate(arr):
		if x > curr_max:
			curr_max = x
			curr_max_idx = i

## kalman.html
<!DOCTYPE html>
<html>
<head>
<style type="text/css">
html,
body {
    margin: 0;
    overflow: hidden;
    height: 100%;
}

## Hegex.hs
module Main (main) where

match :: String -> String -> Bool
match ('^':rest) text     = matchLocal rest text
match rex        (c:rest) = matchLocal rex (c:rest) || match rex rest
match _          _        = False

matchLocal :: String -> String -> Bool
matchLocal []            _         = True
matchLocal "$"           []        = True

## cluster.py
def pairify(it):
  	it0, it1 = itertools.tee(it, 2)
	first = next(it0)
	return zip(itertools.chain([first, first], it0), it1)

def cluster(sequence, maxgap):
	batch = []
	for prev, val in pairify(sequence):
		if abs(val - prev) >= maxgap:
			yield batch

## pid.py
# A simple discrete-time PID controller. If plot is true, this will use matplotlib to show a graph.
# Otherwise, it will simply print out the successive values of the controller.

plot = True

if __name__ == '__main__':
	if plot:
		import matplotlib.pyplot as plt

	v = [0] * 100

## markov.py
from collections import defaultdict
import random

class Markov:
  memory = defaultdict(list)
  separator = ' '

  def get_initial(self):
    return (' ', ' ')

## scatter.py
from mpl_toolkits.basemap import Basemap
from shapely.geometry import Point, MultiPoint
import pandas as pd
import matplotlib.pyplot as plt

x = []
y = []
with open('data.tsv', 'r') as fp:
	for line in fp:
		s = line.split('\t')

## expr.py
def postfix(tokens):
    output_stack = []
    op_stack = []
    for token in tokens:
        if is_number(token):
            output_stack.append(token)
        elif token in ['+', '-', '*', '/']:
            while len(op_stack) > 0:
                if (token in ['+', '-'] and op_stack[-1] in ['*', '/']) or (token in ['*', '/'] and op_stack[-1] in ['*', '/']):
                    output_stack.append(op_stack.pop())

## tree_pairs.py
def build(pairs, root=None):
    tree = {}
    for (child, parent) in pairs:
        if parent == root:
            tree[child] = build(filter(lambda x: x != (child, parent), pairs), child)
    return tree

print build([("H", "G"), ("F", "G"), ("G", "D"), ("E", "D"), ("A", "E"), ("B", "C"), ("C", "E"), ("D", None)])
	import random

	def rand_max(arr):
	curr_max = 0
	curr_max_idx = 0
	curr_max_count = 1
	for i,x in enumerate(arr):
	if x > curr_max:
	curr_max = x
	curr_max_idx = i
	<!DOCTYPE html>
	<html>
	<head>
	<style type="text/css">
	html,
	body {
	margin: 0;
	overflow: hidden;
	height: 100%;
	}
	module Main (main) where

	match :: String -> String -> Bool
	match ('^':rest) text = matchLocal rest text
	match rex (c:rest) = matchLocal rex (c:rest) \|\| match rex rest
	match _ _ = False

	matchLocal :: String -> String -> Bool
	matchLocal [] _ = True
	matchLocal "$" [] = True
	def pairify(it):
	it0, it1 = itertools.tee(it, 2)
	first = next(it0)
	return zip(itertools.chain([first, first], it0), it1)

	def cluster(sequence, maxgap):
	batch = []
	for prev, val in pairify(sequence):
	if abs(val - prev) >= maxgap:
	yield batch
	# A simple discrete-time PID controller. If plot is true, this will use matplotlib to show a graph.
	# Otherwise, it will simply print out the successive values of the controller.

	plot = True

	if __name__ == '__main__':
	if plot:
	import matplotlib.pyplot as plt

	v = [0] * 100
	from collections import defaultdict
	import random

	class Markov:
	memory = defaultdict(list)
	separator = ' '

	def get_initial(self):
	return (' ', ' ')
	from mpl_toolkits.basemap import Basemap
	from shapely.geometry import Point, MultiPoint
	import pandas as pd
	import matplotlib.pyplot as plt

	x = []
	y = []
	with open('data.tsv', 'r') as fp:
	for line in fp:
	s = line.split('\t')
	def postfix(tokens):
	output_stack = []
	op_stack = []
	for token in tokens:
	if is_number(token):
	output_stack.append(token)
	elif token in ['+', '-', '*', '/']:
	while len(op_stack) > 0:
	if (token in ['+', '-'] and op_stack[-1] in ['', '/']) or (token in ['', '/'] and op_stack[-1] in ['*', '/']):
	output_stack.append(op_stack.pop())
	def build(pairs, root=None):
	tree = {}
	for (child, parent) in pairs:
	if parent == root:
	tree[child] = build(filter(lambda x: x != (child, parent), pairs), child)
	return tree

	print build([("H", "G"), ("F", "G"), ("G", "D"), ("E", "D"), ("A", "E"), ("B", "C"), ("C", "E"), ("D", None)])