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

Another possible site of floating point error

Browse Source
This commit is contained in:
Erica Fischer
2023-07-12 12:57:19 -07:00
parent 8431bd2038
commit 146fcae628
1 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tile.cpp
+10 -10
View File
@@ -2290,12 +2290,12 @@ long long write_tile(decompressor *geoms, std::atomic<long long> *geompos_in, ch
// (which Douglas-Peucker simplification would keep anyway, // (which Douglas-Peucker simplification would keep anyway,
// if its search weren't being split up by polygon side). // if its search weren't being split up by polygon side).
double far = 0; long long far = 0;
size_t which = i; size_t which = i;
for (size_t k = i + 1; k < j - 1; k++) { for (size_t k = i + 1; k < j - 1; k++) {
double xd = sf.geometry[k].x - sf.geometry[i].x; long long xd = sf.geometry[k].x - sf.geometry[i].x;
double yd = sf.geometry[k].y - sf.geometry[i].y; long long yd = sf.geometry[k].y - sf.geometry[i].y;
double d = xd * xd + yd * yd; long long d = xd * xd + yd * yd;
if (d > far) { if (d > far) {
far = d; far = d;
which = k; which = k;
@@ -2310,14 +2310,14 @@ long long write_tile(decompressor *geoms, std::atomic<long long> *geompos_in, ch
// would keep next. // would keep next.
far = 0; far = 0;
double which2 = i; size_t which2 = i;
for (size_t k = i + 1; k < j - 1; k++) { for (size_t k = i + 1; k < j - 1; k++) {
double xd = sf.geometry[k].x - sf.geometry[i].x; long long xd = sf.geometry[k].x - sf.geometry[i].x;
double yd = sf.geometry[k].y - sf.geometry[i].y; long long yd = sf.geometry[k].y - sf.geometry[i].y;
double xd2 = sf.geometry[k].x - sf.geometry[which].x; long long xd2 = sf.geometry[k].x - sf.geometry[which].x;
double yd2 = sf.geometry[k].y - sf.geometry[which].y; long long yd2 = sf.geometry[k].y - sf.geometry[which].y;
double d = xd * xd + yd * yd + xd2 * xd2 + yd2 * yd2; long long d = xd * xd + yd * yd + xd2 * xd2 + yd2 * yd2;
if (d > far) { if (d > far) {
far = d; far = d;
which2 = k; which2 = k;