glassner@arisia.Xerox.COM (Andrew Glassner) (01/31/91)
I would like to find a robust, public-domain polyhedron intersector. Input to the routine would be two polyhedra (it's okay if they're restricted to be non-self-intersecting), and the output is the set of 0 or more polyhedra representing their intersection(s). I can guarantee my input polyhedra will be of genus 0. This isn't an easy problem to solve in a numerically robust fashion, but it is well understood, and several solutions are well documented. Nevertheless, it's still a tricky program to write, and I don't want to spend time crafting my own code if reliable software already exists. If anyone has or can point me to a stable public-domain routine for polyhedron intersection (either Pascal or C would be fine), I'd appreciate a note. Thanks! -Andrew Glassner (glassner.pa@xerox.com) (I want something public-domain because this is to be part of a package that I would like to ultimately release back to public domain)