AlexandreJ wrote:The result is that finding the real solution is hard, really hard.
AlexandreJ wrote:I'm aware of this limitation.
To find the bigger enclosed area within a general polygon is a NP-complete algorithm (for definition : NP-Complete).
The result is that finding the real solution is hard really hard.
So I designed a novel algorithm to find an approximate solution and this solution is not always the right one. In planar for example, it ignores the hole that can arise in the middle top edge or middle bottom edge. In fact, it works good with convex polygons but less good with concave.
Users browsing this forum: No registered users and 2 guests