Can anyone point to Clojure code for detecting when two 3d shapes overlap, when given the [x y z] vertices of the two shapes?
The specific case I care about will always involve two regular tetrahedra (each of which is specified by 4 vertices), which may allow for special simplifications or efficiencies, but I'd be happy to have a more general solution as long as it's not weirdly slow. I know that there are some sophisticated algorithms for doing this sort of thing (e.g. [1]), but the the algorithms I've found aren't trivial and the only source code I've found is pretty messy and would take some work to translate (e.g. from C). And I figure that if anybody is doing 3d stuff in Clojure then the code for this is probably floating around somewhere... but I haven't been able to find it. Does anyone know of (or want to write :-) code for this? I guess that a Java solution would also be workable, if I the interop is straightforward enough, but it'd be nicer to have a working algorithm in Clojure. Thanks, -Lee [1] Fast tetrahedron-tetrahedron overlap algorithm. F. Ganovelli, F. Ponchio and C. Rocchini August 11, 2002. http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=862BA3F999652E3B0BC1E7A6A3E04D49?doi=10.1.1.114.2540&rep=rep1&type=pdf -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
