by next friday i need to have implemented a way to select between normal kdtree point lookups, and nearest-neighbor lookups. Hopefully i'll have that done tonight.
I really think that I need to create my own point object, and hang the facet information directly off of that. right now there are simply parallel arrays for q, numpy.array(x,y), and {point_index: [adjacent faces]} ...
work to be done!
mostly spent time trying to figure out subprocess (which i though i already understood). I am concerned for what will happen with large datasets.
next steps include:
1) design data struture
2) implement slurping of stdout into this structure
3) drink coke
--HG--
rename : lib/smcqhull.py => lib/smcqdelaunay.py
