OSMBonusPack：检查我的GeoPoint是否在多边形内部

Question

我在安卓中使用osmdroid和osmdroid奖励包，绘制了一个多边形。现在我想检查GeoPoint（纬度、经度）是否在该多边形内。我该怎么做？

这里我使用contains方法，但它只接受MotionEvent对象，并且不起作用。是否有其他方法可以实现？

我的代码如下所示。

GeoPoint gPt0 = new GeoPoint(23.215210, 72.648600);
GeoPoint gPt1 = new GeoPoint(23.216030, 72.648340);
GeoPoint gPt2 = new GeoPoint(23.217400, 72.649070);
GeoPoint gPt3 = new GeoPoint(23.216570, 72.650290);
GeoPoint gPt4 = new GeoPoint(23.214750, 72.649130);

List<GeoPoint> list = new ArrayList<>();
list.add(gPt0);
list.add(gPt1);
list.add(gPt2);
list.add(gPt3);
list.add(gPt4);
Polygon polygon = new Polygon(getApplication());
polygon.setPoints(list);
GeoPoint center = new GeoPoint(23.21612, 72.64933);
map.getOverlays().add(polygon);

MotionEvent event = MotionEvent.obtain(1, 1, MotionEvent.ACTION_HOVER_ENTER, (float)23.21602, (float) 72.64926, 1);

Log.e("CONTAINS", polygon.contains(event)+"");

- Bhaumik Belani

Answer 1

当您定义新的运动事件时，X和Y是屏幕上的位置（像素），而不是地图上的位置。此外，在osmdroid的Java文档中还有一些注意事项。

/** Important note: this function returns correct results only if the Polygon has been drawn before, 
 * and if the MapView positioning has not changed. 
 * @param event
 * @return true if the Polygon contains the event position. 
 */
public boolean contains(MotionEvent event)

如果您查看该方法的源代码（https://github.com/osmdroid/osmdroid/blob/master/osmdroid-android/src/main/java/org/osmdroid/bonuspack/overlays/Polygon.java），则只使用 MotionEvent 中的坐标。

return region.contains((int)event.getX(), (int)event.getY());

- mromer

---

但是通过传递屏幕点，我如何知道我的经纬度是否在多边形内（该多边形是从经纬度创建的）？ - Bhaumik Belani

contains 用于地图上的点击。如果您想知道一个坐标是否在多边形内部，可以尝试使用此库 https://github.com/sromku/polygon-contains-point，正如在这个答案中所评论的那样 https://dev59.com/kmUo5IYBdhLWcg3wtRbh。 - mromer

为什么不呢？有什么问题吗？ :) - mromer

Answer 2

请使用Java尝试以下算法：

class Point
{
    int x, y;
 
    Point()
    {}
 
    Point(int p, int q)
    {
        x = p;
        y = q;
    }
}
 
public class Position_Point_WRT_Polygon
{
 
    public static boolean onSegment(Point p, Point q, Point r)
    {
        if (q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x)
                && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y))
            return true;
        return false;
    }
 
    public static int orientation(Point p, Point q, Point r)
    {
        int val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
 
        if (val == 0)
            return 0;
        return (val > 0) ? 1 : 2;
    }
 
    public static boolean doIntersect(Point p1, Point q1, Point p2, Point q2)
    {
 
        int o1 = orientation(p1, q1, p2);
        int o2 = orientation(p1, q1, q2);
        int o3 = orientation(p2, q2, p1);
        int o4 = orientation(p2, q2, q1);
 
        if (o1 != o2 && o3 != o4)
            return true;
 
        if (o1 == 0 && onSegment(p1, p2, q1))
            return true;
 
        if (o2 == 0 && onSegment(p1, q2, q1))
            return true;
 
        if (o3 == 0 && onSegment(p2, p1, q2))
            return true;
 
        if (o4 == 0 && onSegment(p2, q1, q2))
            return true;
 
        return false;
    }
 
    public static boolean isInside(Point polygon[], int n, Point p)
    {
        int INF = 10000;
        if (n < 3)
            return false;
 
        Point extreme = new Point(INF, p.y);
 
        int count = 0, i = 0;
        do
        {
            int next = (i + 1) % n;
            if (doIntersect(polygon[i], polygon[next], p, extreme))
            {
                if (orientation(polygon[i], p, polygon[next]) == 0)
                    return onSegment(polygon[i], p, polygon[next]);
 
                count++;
            }
            i = next;
        } while (i != 0);
 
        return (count & 1) == 1 ? true : false;
    }
 
    public static void main(String args[])
    {
        Point polygon1[] = { new Point(0, 0), new Point(10, 0),
                new Point(10, 10),new Point(5, 5), new Point(0, 10) };
        int n = 5;
 
        Point p = new Point(5, 7);
        System.out.println("Point P(" + p.x + ", " + p.y
                + ") lies inside polygon1: " + isInside(polygon1, n, p));
        p = new Point(11, 11);
        System.out.println("Point P(" + p.x + ", " + p.y
                + ") lies inside polygon1: " + isInside(polygon1, n, p));
 
        Point polygon2[] = { new Point(0, 0), new Point(5, 5), new Point(5, 0) };
        n = 3;
 
        p = new Point(3, 3);
        System.out.println("Point P(" + p.x + ", " + p.y
                + ") lies inside polygon2: " + isInside(polygon2, n, p));
        p = new Point(5, 1);
        System.out.println("Point P(" + p.x + ", " + p.y
                + ") lies inside polygon2: " + isInside(polygon2, n, p));
        p = new Point(8, 1);
        System.out.println("Point P(" + p.x + ", " + p.y
                + ") lies inside polygon2: " + isInside(polygon2, n, p));
 
        Point polygon3[] = { new Point(0, 0), new Point(10, 0),
                new Point(10, 10), new Point(0, 10), new Point(5, 5) };
        n = 5;
 
        p = new Point(-1, 10);
        System.out.println("Point P(" + p.x + ", " + p.y
                + ") lies inside polygon3: " + isInside(polygon3, n, p));
    }
}

- Raj Dharamdme