mapbox-polylabel 2.0.1-1 source package in Ubuntu
Changelog
mapbox-polylabel (2.0.1-1) unstable; urgency=medium * New upstream release. -- Bas Couwenberg <email address hidden> Sat, 06 Jul 2024 17:58:44 +0200
Upload details
- Uploaded by:
- Debian GIS Project
- Uploaded to:
- Sid
- Original maintainer:
- Debian GIS Project
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| mapbox-polylabel_2.0.1-1.dsc | 2.0 KiB | 62b1d8e443724d843e8e7d521996a0e99f3844775415851e369d30645070c1f9 |
| mapbox-polylabel_2.0.1.orig.tar.gz | 55.0 KiB | d51ec39f9f1bc46c551dfdf642f72057a8c2cde2c5e89bc70e0bd712fad63a75 |
| mapbox-polylabel_2.0.1-1.debian.tar.xz | 3.0 KiB | 8d71ec9868e6e0d407ef7dfaaf50cf8dc3709573aa65dd204cc63c0ba4075f76 |
Available diffs
- diff from 2.0.0-1 to 2.0.1-1 (3.3 KiB)
No changes file available.
Binary packages built by this source
- libmapbox-polylabel-dev: Fast algorithm for finding polygon pole of inaccessibility
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)
