Given a large number of points and wanting the smallest area that encompasses all of the points but not wanting the convex hull, the answer would be a shape with an area of zero (assuming the at-least-not-clearly-stated additional requirement of a single connected area, a series of line segments can suffice).
So I think there must be another requirement hiding in there that I'm not inferring. :)
- tye
In reply to Re^2: Better maps with Math::Geometry::Voronoi, and a Challenge for Math Monks (minimal covers)
by tye
in thread Better maps with Math::Geometry::Voronoi, and a Challenge for Math Monks
by samtregar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |