Sat, 21 Nov 2026 05:08:49 UTC Log in
A fast algorithm for finding the pole of inaccessibility of a polygon 70.83 KB built 2026-10-17 05:26:08 GMT

Description

A fast algorithm for finding polygon pole of inaccessibility, the most distant internal point from the polygon outline. Useful for optimal placement of a text label on a polygon.

Dependencies

8 total
Requires7
  • gcc-c++
  • geometry-hpp-devel
  • geometry-hpp-static
  • rapidjson-devel
  • rapidjson-static
  • rpmlib(CompressedFileNames) <= 3.0.4-1
  • rpmlib(FileDigests) <= 4.6.0-1
Provides1
  • polylabel-devel = 2.1.0-1.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances

Files

2
Files 1–2 of 2

Component of

buildroots that installed this RPM

No Buildroots