(intersect-aabb-aabb? {pa :p sa :size} {pb :p sb :size})
(intersect-aabb-aabb? pa pb qa qb)
(intersect-aabb-sphere? {p :p sz :size} {s :p r :r})
(intersect-aabb-sphere? p q c r)
(intersect-circle-circle? {p :p r1 :r} {q :p r2 :r})
(intersect-circle-circle? p r1 q r2)
(intersect-line2-line2? [px1 py1 :as p]
[qx1 qy1 :as q]
[px2 py2 :as lp]
[qx2 qy2 :as lq])
(intersect-ray-sphere? {rp :p dir :dir} {p :p r :r})
(intersect-ray-sphere? rp dir p r)
(intersect-rect-rect? {[px py] :p [w h] :size} {[qx qy] :p [qw qh] :size})
(intersect-rect-rect? [px1 py1] [qx1 qy1] [px2 py2] [qx2 qy2])
(intersect-sphere-sphere? {p1 :p r1 :r} {p2 :p r2 :r})
(intersect-sphere-sphere? p1 r1 p2 r2)
(intersect-tetrahedra? [pa pb pc pd :as p] [qa qb qc qd :as q])
Takes 2 seqs of 4 3D points, each defining a tetrahedron. Returns true if they intersect. Orientation of points is irrelevant (unlike in the original algorithm this implementation is based on).
Takes 2 seqs of 4 3D points, each defining a tetrahedron. Returns true if they intersect. Orientation of points is irrelevant (unlike in the original algorithm this implementation is based on).
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close