in reply to Re^4: searching polygons not merged
in thread searching polygons not merged
A pointy triangle could be idealized as an edge, the resulting circle will always be bigger than a bounding box.
Indeed. Any particularly flat (in either Cartesian direction) ploygon is going to be better suited to a bounding box. Whether these are plentiful or rare in the data set is only something which the OP can answer.
You might now claim that something like a regular octagon is better represented by a circle (probably).
I'd claim that not only is any regular polygon with n>4 better represented by a circle, the circle is trivially easy to compute. If the data set were all regular polygons (and I'm not assuming for one minute that they are in this case) then circles would be the obvious choice.
A little domain knowledge here would help to inform the choice of bounding box or circle. Horses for courses.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^6: searching polygons not merged
by haj (Vicar) on Oct 28, 2018 at 19:39 UTC | |
by hippo (Bishop) on Oct 28, 2018 at 22:52 UTC | |
by haj (Vicar) on Oct 28, 2018 at 23:56 UTC | |
by LanX (Saint) on Oct 29, 2018 at 02:57 UTC | |
by hippo (Bishop) on Oct 29, 2018 at 08:59 UTC | |
Re^6: searching polygons not merged
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 | |
Re^6: searching polygons not merged
by LanX (Saint) on Oct 28, 2018 at 18:33 UTC |
In Section
Seekers of Perl Wisdom