4 ms·
I like computing the volume of the intersection of 3 orthogonal cylinders as a less trivial example problem. It's still easy to compute whether a given point is
by jwmerrill 12y ago
I like computing the volume of the intersection of 3 orthogonal cylinders as a less trivial example problem. It's still easy to compute whether a given point is inside the volume, and there's still an analytic solution to compare to, but the problem is complicated enough that you start to appreciate how much easier MC is than other approaches.
- jwmerrill 12y agoOr compute the area of the mandlebrot set. This one has the advantage of being highly non-convex, which makes it hard to decide how to implement a recursive subdivision routine, since you don't know whether some of the target area is inside a given square just from looking at a few points on its boundary.
- keithpeter 12y agoMandlebrot set a bit over the maths level for intended group, but other repeated maps like logistic equation might be OK. I'll go with the cylinders first!
- keithpeter 12y agoSounds nice. Easy to visualise and close enough to a crucible design (toroidal volume intersected by a cube off axis and oblique to the central axis of the toroid) I once heard of in the days of Fortran.