Examples with PolygonSplitterFilter uk.me.parabola.mkgmap.filters.PolygonSplitterFilter used on opensource projects

Example 1 with PolygonSplitterFilter

use of uk.me.parabola.mkgmap.filters.PolygonSplitterFilter in project mkgmap by openstreetmap.

the class MapBuilder method processShapes.

/**
 * Step through the polygons, filter, simplify if necessary, and create a map
 * shape which is then added to the map.
 *
 * Note that the location and resolution of map elements is relative to the
 * subdivision that they occur in.
 *
 * @param map	The map to add polygons to.
 * @param div	The subdivision that the polygons belong to.
 * @param shapes The polygons to be added.
 */
private void processShapes(Map map, Subdivision div, List<MapShape> shapes) {
    // Signal that we are beginning to draw the shapes.
    div.startShapes();
    int res = div.getResolution();
    FilterConfig config = new FilterConfig();
    config.setResolution(res);
    config.setLevel(div.getZoom().getLevel());
    config.setRoutable(doRoads);
    if (mergeShapes) {
        ShapeMergeFilter shapeMergeFilter = new ShapeMergeFilter(res, orderByDecreasingArea);
        List<MapShape> mergedShapes = shapeMergeFilter.merge(shapes);
        shapes = mergedShapes;
    }
    if (orderByDecreasingArea && shapes.size() > 1) {
        // sort so that the shape with the largest area is processed first
        Collections.sort(shapes, new Comparator<MapShape>() {

            public int compare(MapShape s1, MapShape s2) {
                return Long.compare(Math.abs(s2.getFullArea()), Math.abs(s1.getFullArea()));
            }
        });
    }
    preserveHorizontalAndVerticalLines(res, shapes);
    LayerFilterChain filters = new LayerFilterChain(config);
    filters.addFilter(new PolygonSplitterFilter());
    if (enableLineCleanFilters && (res < 24)) {
        filters.addFilter(new RoundCoordsFilter());
        int sizefilterVal = getMinSizePolygonForResolution(res);
        if (sizefilterVal > 0)
            filters.addFilter(new SizeFilter(sizefilterVal));
        // Is there an similar algorithm for polygons?
        if (reducePointErrorPolygon > 0)
            filters.addFilter(new DouglasPeuckerFilter(reducePointErrorPolygon));
    }
    filters.addFilter(new RemoveObsoletePointsFilter());
    filters.addFilter(new RemoveEmpty());
    filters.addFilter(new LinePreparerFilter(div));
    filters.addFilter(new ShapeAddFilter(div, map));
    for (MapShape shape : shapes) {
        if (shape.getMinResolution() > res)
            continue;
        filters.startFilter(shape);
    }
}