mirror of
https://github.com/felt/tippecanoe.git
synced 2026-10-03 00:45:41 +02:00
Erica Fischer
bc3ef87c3f
* Track output position at the file level instead of within each tile * Track file position where the child tile data begins * Add option and document its intended behavior * Changing the detail loop to account for stopping early * I forgot I already added an option for this * Stop early if we can make a complete tile * Add a test of zoom truncation with limited feature count * Forgot to commit the actual code change * Make room for a vertex count in the header of each serialized tile * Estimate tile complexity; don't try truncating when unlikely to work * Be more conservative, because ever retrying a tile is a big speed hit * If stopping early, don't simplify or clean; leave that to overzoom * Add tiny polygon reduction / dust to overzoom * Don't try to stop early in the children if we dropped anything by rate * Fflush here too before pwriting * Don't stop early if we ended up dropping any features. Rework the can-the-next-zoom-stop-early logic to avoid going one zoom further than needed. * Fix warning * Fix warnings * Oops, checking for the wrong expected return value * Cleanup from adding line simplification in overzoom * Current (wrong) behavior when combining coalescing and truncating * Keep a list of parent tiles to skip rather than truncating * Now the coalesced tiles in z12 get children in z13 * Don't double-count feature dropping when the zoom level is retried * Correct README description * Remove todo about special case below basezoom, which is accounted for * Be a little more aggressive in drop-densest determination * Scale tile feature limit for megatiles in the same way as byte limit * Fully deprecate -detect-shared-borders into an alias * Track the distances found in the douglas-peucker recursion * Serialize and deserialize the distance with the vertices * Revert "Serialize and deserialize the distance with the vertices" This reverts commit753f1b7909. * Revert "Track the distances found in the douglas-peucker recursion" This reverts commite5361f8c22. * Revert "Fully deprecate -detect-shared-borders into an alias" This reverts commit0698aeb766. * Better tracking of whether we failed to make a full-detail tile * Put a bloom filter in front of the binary search for shared nodes * Forgot to take out this printf * Improve dispatch of tiling tasks * Still dispatch the biggest tasks first * Track zoom truncation in the strategies list in the tileset metadata * Prescan for small deltas before doing proper simplification * Revert "Prescan for small deltas before doing proper simplification" This reverts commitd1d8238b83. * Update version and changelog * Rename to --generate-variable-depth-tile-pyramid
55 lines
1.9 KiB
C++
55 lines
1.9 KiB
C++
#ifndef OPTIONS_HPP
|
|
#define OPTIONS_HPP
|
|
|
|
#define A_COALESCE ((int) 'c')
|
|
#define A_REVERSE ((int) 'r')
|
|
#define A_REORDER ((int) 'o')
|
|
#define A_LINE_DROP ((int) 'l')
|
|
#define A_DEBUG_POLYGON ((int) '@')
|
|
#define A_POLYGON_DROP ((int) 'p')
|
|
#define A_DETECT_SHARED_BORDERS ((int) 'b')
|
|
#define A_PREFER_RADIX_SORT ((int) 'R')
|
|
#define A_CALCULATE_FEATURE_DENSITY ((int) 'g')
|
|
#define A_INCREASE_GAMMA_AS_NEEDED ((int) 'G')
|
|
#define A_DROP_DENSEST_AS_NEEDED ((int) 's')
|
|
#define A_DROP_FRACTION_AS_NEEDED ((int) 'd')
|
|
#define A_DROP_SMALLEST_AS_NEEDED ((int) 'n')
|
|
#define A_COALESCE_DENSEST_AS_NEEDED ((int) 'S')
|
|
#define A_COALESCE_SMALLEST_AS_NEEDED ((int) 'N')
|
|
#define A_COALESCE_FRACTION_AS_NEEDED ((int) 'D')
|
|
#define A_GRID_LOW_ZOOMS ((int) 'L')
|
|
#define A_DETECT_WRAPAROUND ((int) 'w')
|
|
#define A_EXTEND_ZOOMS ((int) 'e')
|
|
#define A_CLUSTER_DENSEST_AS_NEEDED ((int) 'C')
|
|
#define A_GENERATE_IDS ((int) 'i')
|
|
#define A_CONVERT_NUMERIC_IDS ((int) 'I')
|
|
#define A_HILBERT ((int) 'h')
|
|
#define A_VISVALINGAM ((int) 'v')
|
|
#define A_GENERATE_POLYGON_LABEL_POINTS ((int) 'P')
|
|
#define A_VARIABLE_DEPTH_PYRAMID ((int) 't')
|
|
|
|
#define P_SIMPLIFY ((int) 's')
|
|
#define P_SIMPLIFY_LOW ((int) 'S')
|
|
#define P_SIMPLIFY_SHARED_NODES ((int) 'n')
|
|
#define P_SINGLE_PRECISION ((int) 'N')
|
|
#define P_FEATURE_LIMIT ((int) 'f')
|
|
#define P_KILOBYTE_LIMIT ((int) 'k')
|
|
#define P_DYNAMIC_DROP ((int) 'd')
|
|
#define P_INPUT_ORDER ((int) 'i')
|
|
#define P_POLYGON_SPLIT ((int) 'p')
|
|
#define P_CLIPPING ((int) 'c')
|
|
#define P_DUPLICATION ((int) 'D')
|
|
#define P_TINY_POLYGON_REDUCTION ((int) 't')
|
|
#define P_TINY_POLYGON_REDUCTION_AT_MAXZOOM ((int) 'T')
|
|
#define P_TILE_COMPRESSION ((int) 'C')
|
|
#define P_TILE_STATS ((int) 'g')
|
|
#define P_USE_SOURCE_POLYGON_WINDING ((int) 'w')
|
|
#define P_REVERSE_SOURCE_POLYGON_WINDING ((int) 'W')
|
|
#define P_EMPTY_CSV_COLUMNS ((int) 'e')
|
|
#define P_BASEZOOM_ABOVE_MAXZOOM ((int) 'b')
|
|
|
|
extern int prevent[256];
|
|
extern int additional[256];
|
|
|
|
#endif
|