What if it is additionally known that the shape represented by (x,y,z) -> Bool has a closed, convex area (for example)? Most likely there are then techniques from algorithmic geometry that can find an inside point more efficiently than by iterating blindly through all coordinate triples. Am Donnerstag, 29. Oktober 2015 schrieb Tom Ellis :
I hope this is not a too silly question. It goes like this:
Suppose I have a shape defined as
(x,y,z) -> Bool
how can I find a Point inside this shape? Obviously I could iterate
On Thu, Oct 29, 2015 at 10:01:49AM +0100, martin wrote: through all possible x,y and z, but this appears
very expensive.
There is no better way in general, so if you want to find points inside a shape you should use a different encoding of shapes.
Tom _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org javascript:; http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe