|
Geometry : |
Subject: Re: [geometry] how to find the furthest point pair (= diameter) of a polygon?
From: Adam Wulkiewicz (adam.wulkiewicz_at_[hidden])
Date: 2013-08-14 13:03:12
Hi,
Mateusz Loskot wrote:
>
> By the way, could you share a bit more about what algorithm is planned?
> A brute force approach, like in PostGIS [1], or any of the known algorithms [2],
> or anything else?
>
>
> [1] ST_MinimumBoundingCircle
> http://svn.osgeo.org/postgis/trunk/postgis/postgis.sql.in
> [2] http://en.wikipedia.org/wiki/Smallest-circle_problem
>
The implementation of minimum bounding (n)sphere calculation is probably
also planned. bg::envelope() and bg::return_envelope() will probably
handle other bounding objects than Box. Am I right? Or some other name
is choosen?
Regards,
Adam
Geometry list run by mateusz at loskot.net