This is a sequel to my previous post.
IntCyl[cyl1_, cyl2_] :=
RegionQ[DiscretizeRegion[RegionIntersection[cyl1, cyl2]] // Quiet]
cylinders =
Table[{RandomReal[{-100, 100}, {2, 3}], RandomReal[5]}, {10}];
cylinderslist = Cylinder[First@#, Last@#] & /@ cylinders;
Timing[nint =
Table[Or @@
Table[IntCyl[cylinderslist[[i]], cylinderslist[[j]]], {j, i + 1,
10}], {i, 10}];]
(*{142.887, Null}*)
Is it a way to iprove the performance of the code?
DiscretizeRegion[RegionIntersection[cyl1, cyl2]– Dimitris Dec 01 '15 at 15:59IntCyldetermines whether two cylinders intersect? How is it different than theintfunction from this answer? – Jason B. Dec 01 '15 at 15:59IntCylfails a test case. – Jason B. Dec 01 '15 at 16:07