in reply to Re^2: searching polygons not merged
in thread searching polygons not merged
The minimum circle is more expensive to compute (for an irregular polygon) but that's O(n). Since the circle is smaller it will be no worse and maybe a good bit better for weeding out non-overlaps and the bonus that brings will depend entirely on the dataset being examined. Without seeing sample data, would you take the O(n) hit for an O(n2) gain? I probably would.
(I bet it's not)
It's a gamble either way. :-)
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^4: searching polygons not merged
by LanX (Saint) on Oct 28, 2018 at 12:07 UTC | |
by hippo (Bishop) on Oct 28, 2018 at 14:51 UTC | |
by haj (Vicar) on Oct 28, 2018 at 19:39 UTC | |
by hippo (Bishop) on Oct 28, 2018 at 22:52 UTC | |
by LanX (Saint) on Oct 29, 2018 at 02:57 UTC | |
| |
by haj (Vicar) on Oct 28, 2018 at 23:56 UTC | |
by LanX (Saint) on Oct 28, 2018 at 17:56 UTC | |
by hippo (Bishop) on Oct 28, 2018 at 22:50 UTC | |
by LanX (Saint) on Oct 29, 2018 at 00:54 UTC | |
by LanX (Saint) on Oct 28, 2018 at 18:33 UTC |
In Section
Seekers of Perl Wisdom