add polygon index intersection utility

onthegomap · Apr 10, 2024 · a3d0f9e · a3d0f9e
1 parent ed373ff
commit a3d0f9e
Show file tree

Hide file tree

Showing 2 changed files with 24 additions and 0 deletions.
diff --git a/planetiler-core/src/main/java/com/onthegomap/planetiler/geo/PolygonIndex.java b/planetiler-core/src/main/java/com/onthegomap/planetiler/geo/PolygonIndex.java
@@ -57,6 +57,13 @@ public List<T> getContaining(Point point) {
     return postFilterContaining(point, items);
   }
 
+  /** Returns the data associated with all polygons containing {@code point}. */
+  public List<T> getIntersecting(Geometry geom) {
+    build();
+    List<?> items = index.query(geom.getEnvelopeInternal());
+    return postFilterIntersecting(geom, items);
+  }
+
   private List<T> postFilterContaining(Point point, List<?> items) {
     List<T> result = new ArrayList<>(items.size());
     for (Object item : items) {
@@ -68,6 +75,17 @@ private List<T> postFilterContaining(Point point, List<?> items) {
     return result;
   }
 
+  private List<T> postFilterIntersecting(Geometry geom, List<?> items) {
+    List<T> result = new ArrayList<>(items.size());
+    for (Object item : items) {
+      if (item instanceof GeomWithData<?> value && value.poly.intersects(geom)) {
+        @SuppressWarnings("unchecked") T t = (T) value.data;
+        result.add(t);
+      }
+    }
+    return result;
+  }
+
   /**
    * Returns the data associated with either the polygons that contain {@code point} or if none are found than the
    * nearest polygon to {@code point} with an envelope that contains point.

diff --git a/planetiler-core/src/test/java/com/onthegomap/planetiler/geo/PolygonIndexTest.java b/planetiler-core/src/test/java/com/onthegomap/planetiler/geo/PolygonIndexTest.java
@@ -21,10 +21,13 @@ void testEmpty() {
   void testSingle() {
     index.put(rectangle(0, 1), 1);
     assertListsContainSameElements(List.of(1), index.getContaining(newPoint(0.5, 0.5)));
+    assertListsContainSameElements(List.of(1), index.getIntersecting(newPoint(0.5, 0.5)));
+    assertListsContainSameElements(List.of(1), index.getIntersecting(rectangle(1, 2)));
     assertListsContainSameElements(List.of(1), index.getContainingOrNearest(newPoint(0.5, 0.5)));
 
     assertListsContainSameElements(List.of(), index.getContaining(newPoint(1.5, 1.5)));
     assertListsContainSameElements(List.of(), index.getContainingOrNearest(newPoint(1.5, 1.5)));
+    assertListsContainSameElements(List.of(), index.getIntersecting(rectangle(2, 3)));
   }
 
   @Test
@@ -33,6 +36,9 @@ void testMultipleIdentical() {
     index.put(rectangle(0, 1), 2);
     assertListsContainSameElements(List.of(1, 2), index.getContaining(newPoint(0.5, 0.5)));
     assertListsContainSameElements(List.of(1, 2), index.getContainingOrNearest(newPoint(0.5, 0.5)));
+    assertListsContainSameElements(List.of(1, 2), index.getIntersecting(rectangle(0.5, 1.5)));
+    assertListsContainSameElements(List.of(1, 2), index.getIntersecting(rectangle(1, 2)));
+    assertListsContainSameElements(List.of(), index.getIntersecting(rectangle(2, 3)));
   }
 
   @Test