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

I'm not sure how this ever worked before

Browse Source
This commit is contained in:
Erica Fischer
2023-07-17 16:29:44 -07:00
parent daf16e915c
commit b3e02b7572
4 changed files with 91 additions and 38 deletions
Download Patch File Download Diff File Expand all files Collapse all files
drop.cpp
+53 -17
View File
@@ -1,36 +1,39 @@
#include <cmath>
#include "drop.hpp"
#include "options.hpp"
#include "geometry.hpp"
unsigned long long preserve_point_density_threshold = 0;
int calc_feature_minzoom(struct index *ix, struct drop_state *ds, int maxzoom, double gamma) {
int calc_feature_minzoom(struct index *ix, struct drop_state ds[], int maxzoom, double gamma) {
int feature_minzoom = 0;
if (gamma >= 0 && (ix->t == VT_POINT ||
(additional[A_LINE_DROP] && ix->t == VT_LINE) ||
(additional[A_POLYGON_DROP] && ix->t == VT_POLYGON))) {
for (ssize_t i = maxzoom; i >= 0; i--) {
ds[i].seq++;
for (ssize_t i = 0; i <= maxzoom; i++) {
// This zoom level is now lighter on features than it should be.
ds[i].error -= 1.0 / ds[i].interval;
// printf("z%zd: error %f with interval %f\n", i, ds[i].error, ds[i].interval);
}
ssize_t chosen = maxzoom + 1;
for (ssize_t i = maxzoom; i >= 0; i--) {
if (ds[i].seq < 0) {
feature_minzoom = i + 1;
// The feature we are pushing out
// appears in zooms i + 1 through maxzoom,
// so track where that was so we can make sure
// not to cluster something else that is *too*
// far away into it.
for (ssize_t j = i + 1; j <= maxzoom; j++) {
ssize_t chosen = maxzoom + 1;
for (ssize_t i = 0; i <= maxzoom; i++) {
if (ds[i].error < 0) {
// this zoom level is too light, so it is time to emit a feature.
feature_minzoom = i;
// this feature now appears in this zoom level and all higher zoom levels,
// so each of them has this feature as its last feature, and each of them
// is now one feature heavier than before.
for (ssize_t j = i; j <= maxzoom; j++) {
ds[j].previndex = ix->ix;
ds[j].error += ds[j].interval / ds[j].interval;
// printf("z%zd: now error %f\n", j, ds[j].error);
}
chosen = i + 1;
chosen = i;
break;
} else {
ds[i].seq -= ds[i].interval;
}
}
@@ -44,8 +47,12 @@ int calc_feature_minzoom(struct index *ix, struct drop_state *ds, int maxzoom, d
if (ix->ix - ds[i].previndex > ((1LL << (32 - i)) / preserve_point_density_threshold) * ((1LL << (32 - i)) / preserve_point_density_threshold)) {
feature_minzoom = i;
for (ssize_t j = i; j <= maxzoom; j++) {
// this feature now appears in this zoom level and all higher zoom levels below `chosen`,
// so each of them has this feature as its last feature, and each of them
// is now one feature heavier than before.
for (ssize_t j = i; j < chosen; j++) {
ds[j].previndex = ix->ix;
ds[j].error += ds[j].interval / ds[j].interval;
}
break;
@@ -56,3 +63,32 @@ int calc_feature_minzoom(struct index *ix, struct drop_state *ds, int maxzoom, d
return feature_minzoom;
}
void prep_drop_states(struct drop_state ds[], int maxzoom, int basezoom, double droprate) {
if (basezoom < 0) {
basezoom = maxzoom;
}
// Needs to be signed for interval calculation
// printf("prep! max %d, base %d, rate %f\n", maxzoom, basezoom, droprate);
for (ssize_t i = 0; i <= maxzoom; i++) {
ds[i].previndex = 0;
ds[i].interval = 1; // every feature appears in every zoom level at or above the basezoom
if (i < basezoom) {
// at zoom levels below the basezoom, the fraction of points that are dropped is
// the drop rate to the power of the number of zooms this zoom is below the basezoom
//
// for example:
// basezoom: 1 (droprate ^ 0)
// basezoom - 1: 2.5 (droprate ^ 1)
// basezoom - 2: 6.25 (droprate ^ 2)
// ...
// basezoom - n: (droprate ^ n)
ds[i].interval = std::exp(std::log(droprate) * (basezoom - i));
// printf("%zd: interval %f\n", i, ds[i].interval);
}
ds[i].error = 0;
}
}