[plt-scheme] Computational Geometry

Hi all,

I've been developing lately several very specific algorithms that work
with SAT and SMT specific conversions and solving procedures, which I
can release if someone is interested. Now I'll need to implement
several computational geometry algorithms if none are implemented. Is
there already any kinds of algorithms in scheme out there? Some needed
algorithms are the Double Description Method, the Delaunay
Triangulation, Convex hulls, etc... Anyone?

Thanks,
--
Paulo Jorge Matos - pocm at sat inesc-id pt
Web: http://sat.inesc-id.pt/~pocm
Computer and Software Engineering
INESC-ID - SAT Group