CoverageSimplifierTest.java
/*
* Copyright (c) 2022 Martin Davis.
*
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License 2.0
* and Eclipse Distribution License v. 1.0 which accompanies this distribution.
* The Eclipse Public License is available at http://www.eclipse.org/legal/epl-v20.html
* and the Eclipse Distribution License is available at
*
* http://www.eclipse.org/org/documents/edl-v10.php.
*/
package org.locationtech.jts.coverage;
import org.locationtech.jts.geom.Geometry;
import junit.textui.TestRunner;
import test.jts.GeometryTestCase;
public class CoverageSimplifierTest extends GeometryTestCase {
public static void main(String args[]) {
TestRunner.run(CoverageSimplifierTest.class);
}
public CoverageSimplifierTest(String name) {
super(name);
}
public void testNoopSimple2() {
checkNoop(readArray(
"POLYGON ((100 100, 200 200, 300 100, 200 101, 100 100))",
"POLYGON ((150 0, 100 100, 200 101, 300 100, 250 0, 150 0))" )
);
}
public void testNoopSimple3() {
checkNoop(readArray(
"POLYGON ((100 300, 200 200, 100 200, 100 300))",
"POLYGON ((100 200, 200 200, 200 100, 100 100, 100 200))",
"POLYGON ((100 100, 200 100, 150 50, 100 100))" )
);
}
public void testNoopHole() {
checkNoop(readArray(
"POLYGON ((10 90, 90 90, 90 10, 10 10, 10 90), (20 80, 80 80, 80 20, 20 20, 20 80))",
"POLYGON ((80 20, 20 20, 20 80, 80 80, 80 20))" )
);
}
public void testNoopMulti() {
checkNoop(readArray(
"MULTIPOLYGON (((10 10, 10 50, 50 50, 50 10, 10 10)), ((90 90, 90 50, 50 50, 50 90, 90 90)))",
"MULTIPOLYGON (((10 90, 50 90, 50 50, 10 50, 10 90)), ((90 10, 50 10, 50 50, 90 50, 90 10)))" )
);
}
//---------------------------------------------
public void testRepeatedPointRemoved() {
checkResult(readArray(
"POLYGON ((2 9, 7 6, 9 1, 2 1, 2 1, 3 6, 2 9))" ),
2,
readArray(
"POLYGON ((2 1, 2 9, 7 6, 9 1, 2 1))" )
);
}
public void testRepeatedPointCollapseToLine() {
checkResult(readArray(
"MULTIPOLYGON (((10 10, 10 20, 20 19, 30 20, 30 10, 10 10)), ((10 30, 20 29, 30 30, 30 20, 20 19, 10 20, 10 30)), ((10 20, 20 19, 20 19, 10 20)))" ),
5,
readArray(
"MULTIPOLYGON (((10 20, 20 19, 30 20, 30 10, 10 10, 10 20)), ((30 20, 20 19, 10 20, 10 30, 30 30, 30 20)), ((10 20, 20 19, 10 20)))" )
);
}
public void testRepeatedPointCollapseToPoint() {
checkResult(readArray(
"MULTIPOLYGON (((10 10, 10 20, 20 19, 30 20, 30 10, 10 10)), ((10 30, 20 29, 30 30, 30 20, 20 19, 10 20, 10 30)), ((20 19, 20 19, 20 19)))" ),
5,
readArray(
"MULTIPOLYGON (((10 10, 10 20, 20 19, 30 20, 30 10, 10 10)), ((10 20, 10 30, 30 30, 30 20, 20 19, 10 20)), ((20 19, 20 19, 20 19)))" )
);
}
public void testRepeatedPointCollapseToPoint2() {
checkResult(readArray(
"MULTIPOLYGON (((100 200, 150 195, 200 200, 200 100, 100 100, 100 200)), ((150 195, 150 195, 150 195, 150 195)))" ),
40,
readArray(
"MULTIPOLYGON (((150 195, 200 200, 200 100, 100 100, 100 200, 150 195)), ((150 195, 150 195, 150 195, 150 195)))" )
);
}
//---------------------------------------------
public void testSimple2() {
checkResult(readArray(
"POLYGON ((100 100, 200 200, 300 100, 200 101, 100 100))",
"POLYGON ((150 0, 100 100, 200 101, 300 100, 250 0, 150 0))" ),
10,
readArray(
"POLYGON ((100 100, 200 200, 300 100, 100 100))",
"POLYGON ((150 0, 100 100, 300 100, 250 0, 150 0))" )
);
}
public void testMultiPolygons() {
checkResult(readArray(
"MULTIPOLYGON (((5 9, 2.5 7.5, 1 5, 5 5, 5 9)), ((5 5, 9 5, 7.5 2.5, 5 1, 5 5)))",
"MULTIPOLYGON (((5 9, 6.5 6.5, 9 5, 5 5, 5 9)), ((1 5, 5 5, 5 1, 3.5 3.5, 1 5)))" ),
3,
readArray(
"MULTIPOLYGON (((1 5, 5 9, 5 5, 1 5)), ((5 1, 5 5, 9 5, 5 1))))",
"MULTIPOLYGON (((1 5, 5 5, 5 1, 1 5)), ((5 5, 5 9, 9 5, 5 5)))" )
);
}
public void testSingleRingNoCollapse() {
checkResult(readArray(
"POLYGON ((10 50, 50 90, 60 90, 70 50, 60 10, 10 50))" ),
100000,
readArray(
"POLYGON ((10 50, 60 90, 70 50, 60 10, 10 50))" )
);
}
/**
* Checks that a polygon on the edge of the coverage does not collapse
* under maximal simplification
*/
public void testMultiEdgeRingNoCollapse() {
checkResult(readArray(
"POLYGON ((50 250, 200 200, 180 170, 200 150, 50 50, 50 250))",
"POLYGON ((200 200, 180 170, 200 150, 200 200))"),
40,
readArray(
"POLYGON ((50 250, 200 200, 180 170, 200 150, 50 50, 50 250))",
"POLYGON ((200 200, 180 170, 200 150, 200 200))")
);
}
public void testFilledHole() {
checkResult(readArray(
"POLYGON ((20 30, 20 80, 60 50, 80 20, 50 20, 20 30))",
"POLYGON ((10 90, 90 90, 90 10, 10 10, 10 90), (50 20, 20 30, 20 80, 60 50, 80 20, 50 20))" ),
28,
readArray(
"POLYGON ((20 30, 20 80, 60 50, 80 20, 20 30))",
"POLYGON ((10 90, 90 90, 90 10, 10 10, 10 90), (20 30, 20 80, 60 50, 80 20, 20 30))" )
);
}
public void testTouchingHoles() {
checkResult(readArray(
"POLYGON (( 0 0, 0 11, 19 11, 19 0, 0 0 ), ( 4 5, 12 5, 12 6, 10 6, 10 8, 9 8, 9 9, 7 9, 7 8, 6 8, 6 6, 4 6, 4 5 ), ( 12 6, 14 6, 14 9, 13 9, 13 7, 12 7, 12 6 ))",
"POLYGON (( 12 6, 12 5, 4 5, 4 6, 6 6, 6 8, 7 8, 7 9, 9 9, 9 8, 10 8, 10 6, 12 6 ))",
"POLYGON (( 12 6, 12 7, 13 7, 13 9, 14 9, 14 6, 12 6 ))"),
1.0,
readArray(
"POLYGON ((0 0, 0 11, 19 11, 19 0, 0 0), (4 5, 12 5, 12 6, 10 6, 9 9, 6 8, 6 6, 4 5), (12 6, 14 6, 14 9, 13 7, 12 6))",
"POLYGON ((4 5, 6 6, 6 8, 9 9, 10 6, 12 6, 12 5, 4 5))",
" POLYGON ((12 6, 14 6, 14 9, 13 7, 12 6))" )
);
}
public void testInnerHoleTouchingShell() {
checkResultInner(readArray(
"POLYGON ((200 300, 300 300, 300 100, 100 100, 100 300, 200 300), (170 220, 170 160, 200 140, 210 200, 200 250, 170 220), (170 250, 200 250, 200 300, 180 280, 170 250))",
"POLYGON ((170 220, 200 250, 210 200, 200 140, 170 160, 170 220))",
"POLYGON ((170 250, 180 280, 200 300, 200 250, 170 250))" ),
70.0,
readArray(
"POLYGON ((100 100, 100 300, 200 300, 300 300, 300 100, 100 100), (170 160, 200 140, 200 250, 170 220, 170 160), (170 250, 200 250, 200 300, 170 250))",
"POLYGON ((170 160, 170 220, 200 250, 200 140, 170 160))",
"POLYGON ((170 250, 200 300, 200 250, 170 250))" )
);
}
public void testInnerHolesTouchingHolesAndShell() {
checkResultInner(readArray(
"POLYGON (( 8 5, 9 4, 9 2, 1 2, 1 4, 2 4, 2 5, 1 5, 1 8, 9 8, 9 6, 8 5 ), ( 8 5, 7 6, 6 6, 6 4, 7 4, 8 5 ), ( 7 6, 8 6, 7 7, 7 6 ), ( 6 6, 6 7, 5 6, 6 6 ), ( 6 4, 5 4, 6 3, 6 4 ), ( 7 4, 7 3, 8 4, 7 4 ))"),
4.0,
readArray(
"POLYGON (( 8 5, 9 4, 9 2, 1 2, 1 4, 2 4, 2 5, 1 5, 1 8, 9 8, 9 6, 8 5 ), ( 8 5, 7 6, 6 6, 6 4, 7 4, 8 5 ), ( 7 6, 8 6, 7 7, 7 6 ), ( 6 6, 6 7, 5 6, 6 6 ), ( 6 4, 5 4, 6 3, 6 4 ), ( 7 4, 7 3, 8 4, 7 4 ))")
);
}
public void testHolesTouchingHolesAndShell() {
checkResult(readArray(
"POLYGON (( 8 5, 9 4, 9 2, 1 2, 1 4, 2 4, 2 5, 1 5, 1 8, 9 8, 9 6, 8 5 ), ( 8 5, 7 6, 6 6, 6 4, 7 4, 8 5 ), ( 7 6, 8 6, 7 7, 7 6 ), ( 6 6, 6 7, 5 6, 6 6 ), ( 6 4, 5 4, 6 3, 6 4 ), ( 7 4, 7 3, 8 4, 7 4 ))"),
4.0,
readArray(
"POLYGON ((8 5, 9 2, 1 2, 1 8, 9 8, 8 5), (8 5, 7 6, 6 6, 6 4, 7 4, 8 5))")
);
}
public void testInnerMultiPolygonWithTouchingShells() {
checkResultInner(
readArray(
"MULTIPOLYGON ((( 2 7, 2 8, 3 8, 3 7, 2 7 )), (( 1 6, 1 7, 2 7, 2 6, 1 6 )), (( 0 7, 0 8, 1 8, 1 7, 0 7 )), (( 0 5, 0 6, 1 6, 1 5, 0 5 )), (( 2 5, 2 6, 3 6, 3 5, 2 5 )))"),
1.0,
readArray(
"MULTIPOLYGON ((( 2 7, 2 8, 3 8, 3 7, 2 7 )), (( 1 6, 1 7, 2 7, 2 6, 1 6 )), (( 0 7, 0 8, 1 8, 1 7, 0 7 )), (( 0 5, 0 6, 1 6, 1 5, 0 5 )), (( 2 5, 2 6, 3 6, 3 5, 2 5 )))")
);
}
public void testMultiPolygonWithTouchingShells() {
checkResult(
readArray(
"MULTIPOLYGON (((1 6, 1 7, 2 7, 2 6, 1 6)), ((0 7, 0 8, 1 8, 1.2 7.5, 1 7, 0 7)), ((0 5, 0 6, 1 6, 1.2 5.5, 1 5, 0 5)))"),
1.0,
readArray(
"MULTIPOLYGON (((0 5, 0 6, 1 6, 1 5, 0 5)), ((0 7, 0 8, 1 8, 1 7, 0 7)), ((1 6, 1 7, 2 6, 1 6)))")
);
}
public void testInnerTouchingShells() {
checkResultInner(readArray(
"POLYGON ((0 0, 0 5, 5 6, 10 5, 10 0, 0 0))",
"POLYGON ((0 10, 5 6, 10 10, 0 10))"),
4.0,
readArray(
"POLYGON ((0 0, 0 5, 5 6, 10 5, 10 0, 0 0))",
"POLYGON ((0 10, 5 6, 10 10, 0 10))")
);
}
public void testShellSimplificationAtStartingNode() {
checkResult(readArray(
"POLYGON (( 1 5, 1 7, 5 7, 5 3, 2 3, 1 5 ))"),
1.5,
readArray(
"POLYGON ((1 7, 5 7, 5 3, 2 3, 1 7))")
);
}
public void testInnerAtStartingNode() {
checkResultInner(readArray(
"POLYGON (( 0 5, 0 9, 6 9, 6 2, 1 2, 0 5 ), ( 1 5, 2 3, 5 3, 5 7, 1 7, 1 5 ))",
"POLYGON (( 1 5, 1 7, 5 7, 5 3, 2 3, 1 5 ))"),
1.5,
readArray(
"POLYGON ((0 5, 0 9, 6 9, 6 2, 1 2, 0 5), (1 7, 2 3, 5 3, 5 7, 1 7))",
"POLYGON ((1 7, 5 7, 5 3, 2 3, 1 7))")
);
}
public void testAtStartingNode() {
checkResult(readArray(
"POLYGON (( 0 5, 0 9, 6 9, 6 2, 1 2, 0 5 ), ( 1 5, 2 3, 5 3, 5 7, 1 7, 1 5 ))",
"POLYGON (( 1 5, 1 7, 5 7, 5 3, 2 3, 1 5 ))"),
1.5,
readArray(
"POLYGON ((0 9, 6 9, 6 2, 1 2, 0 9), (1 7, 2 3, 5 3, 5 7, 1 7))",
"POLYGON ((1 7, 5 7, 5 3, 2 3, 1 7))")
);
}
//---------------------------------
public void testInnerSimple() {
checkResultInner(readArray(
"POLYGON ((50 50, 50 150, 100 190, 100 200, 200 200, 160 150, 120 120, 90 80, 50 50))",
"POLYGON ((100 0, 50 50, 90 80, 120 120, 160 150, 200 200, 250 100, 170 50, 100 0))" ),
100,
readArray(
"POLYGON ((50 50, 50 150, 100 190, 100 200, 200 200, 50 50))",
"POLYGON ((200 200, 50 50, 100 0, 170 50, 250 100, 200 200))" )
);
}
//---------------------------------
public void testAllEmpty() {
checkResult(readArray(
"POLYGON EMPTY",
"POLYGON EMPTY" ),
1,
readArray(
"POLYGON EMPTY",
"POLYGON EMPTY" )
);
}
public void testOneEmpty() {
checkResult(readArray(
"POLYGON ((1 9, 5 9.1, 9 9, 9 1, 1 1, 1 9))",
"POLYGON EMPTY" ),
1,
readArray(
"POLYGON ((1 9, 9 9, 9 1, 1 1, 1 9))",
"POLYGON EMPTY" )
);
}
public void testEmptyHole() {
checkResult(readArray(
"POLYGON ((1 9, 5 9.1, 9 9, 9 1, 1 1, 1 9), EMPTY)",
"POLYGON EMPTY" ),
1,
readArray(
"POLYGON ((1 9, 9 9, 9 1, 1 1, 1 9), EMPTY)",
"POLYGON EMPTY" )
);
}
//============== Test with removed rings =======================
// A Polygon with a small hole containing another Polygon - small Polygon is primary so is not removed
public void testPolygonInHoleNotRemoved() {
checkResult(readArray(
"POLYGON ((1 9, 9 9, 9 1, 1 1, 1 9), (2 2, 2 3, 3 3, 2 2))",
"POLYGON ((2 2, 2 3, 3 3, 2 2))"
),
1,
readArray(
"POLYGON ((1 9, 9 9, 9 1, 1 1, 1 9), (2 2, 2 3, 3 3, 2 2))",
"POLYGON ((2 2, 2 3, 3 3, 2 2))" )
);
}
public void testMultiPolygonWithSmallPartRemoved() {
checkResult(readArray(
"MULTIPOLYGON (((11 9, 15 9, 15 5, 11 5, 11 9)), ((11 2, 12 2, 11 1, 11 2)))",
"POLYGON ((15 9, 18 9, 19 4, 14 1, 15 5, 15 9))"
),
1,
readArray(
"POLYGON ((11 5, 11 9, 15 9, 15 5, 11 5))",
"POLYGON ((15 9, 18 9, 19 4, 14 1, 15 5, 15 9))" )
);
}
public void testMultiPolygonWithTouchingSmallPartsRemoved() {
checkResult(readArray(
"MULTIPOLYGON (((1 5, 5 5, 5 1, 1 1, 1 5)), ((6 3, 7 2, 6 2, 6 3)), ((8 2, 7 2, 8 3, 8 2)))"
),
1,
readArray(
"POLYGON ((1 5, 5 5, 5 1, 1 1, 1 5)))" )
);
}
public void testMultiPolygonHolesSmallPartRemoved() {
checkResult(readArray(
"POLYGON ((0 9, 9 9, 9 0, 0 0, 0 9), (2 5, 2 4, 3 5, 2 5), (4 5, 4 3, 6 3, 6 5, 4 5))",
"MULTIPOLYGON (((2 5, 3 5, 2 4, 2 5)), ((4 5, 6 5, 6 3, 4 3, 4 5)))"
),
1,
readArray(
"POLYGON ((0 9, 9 9, 9 0, 0 0, 0 9), (4 5, 4 3, 6 3, 6 5, 4 5))",
"POLYGON ((4 5, 6 5, 6 3, 4 3, 4 5))" )
);
}
public void testMultiPolygonHolesSmallPart() {
checkResultRemovalSize(readArray(
"POLYGON ((0 9, 9 9, 9 0, 0 0, 0 9), (2 5, 2 4, 3 5, 2 5), (4 5, 4 3, 6 3, 6 5, 4 5))",
"MULTIPOLYGON (((2 5, 3 5, 2 4, 2 5)), ((4 5, 6 5, 6 3, 4 3, 4 5)))"
),
1, 0,
readArray(
"POLYGON ((0 9, 9 9, 9 0, 0 0, 0 9), (2 5, 2 4, 3 5, 2 5), (4 5, 4 3, 6 3, 6 5, 4 5))",
"MULTIPOLYGON (((2 5, 3 5, 2 4, 2 5)), ((4 5, 6 5, 6 3, 4 3, 4 5)))" )
);
}
public void testTolerances() {
checkResult(readArray(
"POLYGON ((1 19, 6 19, 7 11, 6 1, 1 1, 1 19))",
"POLYGON ((6 19, 12 19, 11 15, 12 1, 6 1, 7 11, 6 19))",
"POLYGON ((12 19, 19 19, 22 10, 19 1, 12 1, 11 15, 12 19))"
),
new double[] { 0, 3, 6 },
readArray(
"POLYGON ((6 19, 7 11, 6 1, 1 1, 1 19, 6 19))",
"POLYGON ((6 19, 12 19, 12 1, 6 1, 7 11, 6 19))",
"POLYGON ((12 19, 19 19, 19 1, 12 1, 12 19))" )
);
}
//=================================
private void checkNoop(Geometry[] input) {
Geometry[] actual = CoverageSimplifier.simplify(input, 0);
checkEqual(input, actual);
}
private void checkResult(Geometry[] input, double[] tolerances, Geometry[] expected) {
Geometry[] actual = CoverageSimplifier.simplify(input, tolerances);
checkEqual(expected, actual);
}
private void checkResult(Geometry[] input, double tolerance, Geometry[] expected) {
Geometry[] actual = CoverageSimplifier.simplify(input, tolerance);
checkEqual(expected, actual);
}
private void checkResultRemovalSize(Geometry[] input, double tolerance, double removalFactor, Geometry[] expected) {
CoverageSimplifier simplifier = new CoverageSimplifier(input);
simplifier.setRemovableRingSizeFactor(removalFactor);
Geometry[] actual = simplifier.simplify(tolerance);
checkEqual(expected, actual);
}
private void checkResultInner(Geometry[] input, double tolerance, Geometry[] expected) {
Geometry[] actual = CoverageSimplifier.simplifyInner(input, tolerance);
checkEqual(expected, actual);
}
}