Java中如何检测LineString与Polygon相交及生成避障线串

Your initial approach works for checking if endpoints lie inside polygons, but as you correctly noticed, it fails to detect cases where a line segment cuts through a polygon without either endpoint being inside. Let's solve this using Mapbox Turf's dedicated spatial intersection utilities.

The Right Tool for the Job: booleanIntersects #

Mapbox Turf's TurfBooleans.booleanIntersects() method is designed to check if any two geometric shapes (like a line segment and a polygon) intersect in any way—this includes:

• Segments cutting through polygon boundaries (endpoints outside)
• Endpoints lying inside the polygon
• Segments entirely contained within the polygon
• Segments overlapping with polygon edges

Updated Code Implementation #

Here's how to modify your method to cover all intersection scenarios:

import com.mapbox.geojson.LineString;
import com.mapbox.geojson.Point;
import com.mapbox.geojson.Polygon;
import com.mapbox.turf.TurfBooleans;
import java.util.Arrays;
import java.util.List;

public boolean doesSegmentIntersectPolygons(Double startLng, Double startLat, Double endLng, Double endLat, List<Polygon> polygons) {
    // Create the line segment from the previous coordinate (start) and current endpoint (end)
    Point startPoint = Point.fromLngLat(startLng, startLat);
    Point endPoint = Point.fromLngLat(endLng, endLat);
    LineString segment = LineString.fromLngLats(Arrays.asList(startPoint, endPoint));

    // Check against each polygon in the list
    for (Polygon polygon : polygons) {
        if (TurfBooleans.booleanIntersects(segment, polygon)) {
            return true; // Return immediately if any intersection is found
        }
    }
    return false;
}

Key Notes: #

• Why this works: Unlike TurfJoins.inside(), which only checks point-in-polygon, booleanIntersects() evaluates the full spatial relationship between the line segment and polygon. It will return true for any case where the two shapes touch or overlap in any way.
• Efficiency: If you have a large number of polygons, consider early termination (returning as soon as an intersection is found) to save computation time, as shown in the example.
• Edge Cases: This method handles edge cases like segments touching polygon vertices, overlapping with polygon edges, or being fully enclosed within a polygon—all scenarios your original method would miss.

内容的提问来源于stack exchange，提问作者RishtarCode47