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
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
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
Geometry list run by mateusz at loskot.net