polylabel provides a fast algorithm for finding polygon pole of
inaccessibility, the most distant internal point from the polygon
outline (not to be confused with centroid). Useful for optimal placement
of a text label on a polygon.
.
It's an iterative grid algorithm, inspired by the paper by
Garcia-Castellanos & Lombardo, 2007. Unlike the one in the paper, this
algorithm:
.
* guarantees finding global optimum within the given precision
* is many times faster (10-40x)
Installed Size: 19.5 kB
Architectures: all