Subject: Re: [geometry] how to find the furthest point pair (= diameter) of a polygon?
From: Mateusz Loskot (mateusz_at_[hidden])
Date: 2013-08-15 18:42:21
On 15 August 2013 18:15, Barend Gehrels <barend_at_[hidden]> wrote:
> On 14-8-2013 19:03, Adam Wulkiewicz wrote:
>> Mateusz Loskot wrote:
>>> By the way, could you share a bit more about what algorithm is planned?
>>> A brute force approach, like in PostGIS , or any of the known
>>> algorithms ,
>>> or anything else?
>>>  ST_MinimumBoundingCircle
>>>  http://en.wikipedia.org/wiki/Smallest-circle_problem
>> bg::envelope() and bg::return_envelope() will probably handle other
>> bounding objects than Box. Am I right? Or some other name is choosen?
> As said earlier, envelope is an OGC algorithm with a specific meaning and
> the name is well-chosen. I guess more than 99% of the envelopes in your
> postbox is rectangular. The association is OK.
> So we might stick to PostGIS convention and call it minimum_bounding_circle,
> or replace the circle with a "ball" or "nsphere" suffix to denote
> dimensions higher than 2.
It all sounds good to me.
I personally favour longer and more descriptive names
like minimum_bounding_circle, minimum_bounding_box|rectangle, etc.
-- Mateusz Loskot, http://mateusz.loskot.net "Participation in this whole process is a form of torture" ~~ Szalony, wspinanie.pl
Geometry list run by mateusz at loskot.net