diegoripley/tippecanoe
1
0
Fork 0
mirror of https://github.com/felt/tippecanoe.git synced 2026-10-02 16:35:40 +02:00
Code Issues Packages Projects Releases Wiki Activity

Use a label point for the general representative point for polygons

Browse Source 
(Skipping the iteration to find one that is as far as possible from
the borders)

This makes the labels look better in many cases (like France at z1)
but unfortunately ripples into changing the sequence of polygons in
many tests, so the diff is big.
This commit is contained in:
Erica Fischer
2022-10-07 12:11:12 -07:00
parent 2f0c9bf9c8
commit 2261adf05e
55 changed files with 25015 additions and 24803 deletions
Download Patch File Download Diff File Expand all files Collapse all files
serial.cpp
+17 -1
View File
@@ -565,8 +565,24 @@ int serialize_feature(struct serialization_state *sst, serial_feature &sf) {
// keep old behavior, which loses one bit of precision at the bottom
midx = (sf.bbox[0] / 2 + sf.bbox[2] / 2) & ((1LL << 32) - 1);
midy = (sf.bbox[1] / 2 + sf.bbox[3] / 2) & ((1LL << 32) - 1);
} else if (sf.t == VT_POLYGON) {
// generate a label point, but without doing the extra work to find one
// that is as far as possible from the borders
drawvec dv = polygon_to_anchor(sf.geometry, false);
if (dv.size() > 0) {
midx = dv[0].x;
midy = dv[0].y;
} else {
// shouldn't happen, but just in case
midx = (sf.bbox[0] / 2 + sf.bbox[2] / 2) & ((1LL << 32) - 1);
midy = (sf.bbox[1] / 2 + sf.bbox[3] / 2) & ((1LL << 32) - 1);
}
// If off the edge of the plane, mask to bring it back into the addressable area
midx = midx & ((1LL << 32) - 1);
midy = midy & ((1LL << 32) - 1);
} else {
// To reduce the chances of giving multiple polygons or linestrings
// To reduce the chances of giving multiple linestrings
// the same index, use an arbitrary but predictable point from the
// geometry as the index point rather than the bounding box center
// as was previously used. The index point chosen comes from a hash