libmapbox-polylabel-dev binary package in Ubuntu Oracular s390x
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)
Publishing history
| Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
|---|---|---|---|---|---|---|---|---|---|
| 2024-07-07 02:15:02 UTC | Published | Ubuntu Oracular s390x | release | universe | libdevel | Optional | 2.0.1-1 | ||
|
|||||||||
| Deleted | Ubuntu Oracular s390x | proposed | universe | libdevel | Optional | 2.0.1-1 | |||
|
|||||||||
| 2024-07-07 02:15:29 UTC | Superseded | Ubuntu Oracular s390x | release | universe | libdevel | Optional | 2.0.0-1 | ||
|
|||||||||
| 2024-07-08 06:10:20 UTC | Deleted | Ubuntu Oracular s390x | proposed | universe | libdevel | Optional | 2.0.0-1 | ||
|
|||||||||
| 2024-06-26 19:39:09 UTC | Superseded | Ubuntu Oracular s390x | release | universe | libdevel | Optional | 1.1.0-1 | ||
|
|||||||||
| 2024-06-28 00:10:18 UTC | Deleted | Ubuntu Oracular s390x | proposed | universe | libdevel | Optional | 1.1.0-1 | ||
|
|||||||||
