Is anyone out there a geometric algorithms expert? I need to come up with a triangulation algorithm that uses and oracle function to determine if a function is in our out of a set. I want to do this is because define objects with a mathematical function, like x^2+y^2+z^2<1, by taking unions, complements and intersections of different sets, i.e. set theoretic operations. If everything were smooth, this would be easy, but sometimes an object has sharp edges and I don’t know how to deal with that.
All of that is way over my head, but reminds me of some other stuff I didn’t understand by the author of ImplicitCAD. http://christopherolah.wordpress.com/2011/11/06/manipulation-of-implicit-functions-with-an-eye-on-cad/
Awesome! He sounds exactly like the guy I should be talking to.
You might want to look at the paper “Isosurfaces Over Simplicial Partitions of Multiresolution Grids”.
Thanks.