Question

Here’s the situation:

I have a predetermined GPS route that the user will run. The route has some checkpoints and the user should pass near all of them (think of them as a racing game checkpoint, that prevents the user from taking shortcuts). I need to ensure that the user passes through all the checkpoints.
I want to determine an area that will be considered inside a checkpoint’s radius, but I don’t want it to be just a radial area, it should be an area taking into consideration the form of the path.
Didn’t understand it? Neither did I. Look at this poorly drawn image to understand it better:

The black lines represents the pre-determined path, the blue ball is the checkpoint and the blue polygon is the wanted area. The green line is a more precise user, and the red line is a less accurate user (a drunk guy driving maybe? lol). Both lines should be inside the polygon, but a user who skips totally the route shouldn’t.

I already saw somewhere here a function to check is the user is inside a polygon like this, but I need to know how to calculate the polygon.

Any suggestions?

EDIT:

I’m considering using the simple distanceTo() function to just draw an imaginary circle and check if the user is there. That’s good because is so much simple to implement and understand, and bad because to make sure the most erronic user passes whithin the checkpoint I would need a big radius, making the correct user enter the checkpoint area sooner than expected.

And just so you guys understand the situation better, this is for an app that is supposed to be used in traffic (car or bus), and the checkpoints should be landmarks or spots that divides your route, for example, somewhere where traffic jam starts or stops.

Answer 1

You could just check the distance between the two, assuming you know the GeoLocation of the checkpoint.

Use the distanceTo function and setup a threshold of however many meters the user needs to be from the checkpoint to continue on.

Edit

Since you want to avoid distanceTo, here is a small function I wrote a while back to check if a point is in a polygon:

public boolean PIP(Point point, List<Point> polygon){
    boolean nodepolarity=false;
    int sides = polygon.size();
    int j = sides -1;
    for(int i=0;i<sides;i++){
        if((polygon.get(i).y<point.y && polygon.get(j).y>=point.y) ||(polygon.get(j).y<point.y && polygon.get(i).y>=point.y)){
            if (polygon.get(i).x+(point.y-polygon.get(i).y)/(polygon.get(j).y-polygon.get(i).y)*(polygon.get(j).x-polygon.get(i).x)<point.x) {
                nodepolarity=!nodepolarity; 
            }
        }
    j=i;
    }
    return nodepolarity; //FALSE=OUTSIDE, TRUE=INSIDE
}

List<Point> polygon is a list of the points that make up a polygon.

This uses the Ray casting algorithm to determine how many intersections a ray makes through the polygon.

All you would need to do is create the ‘boundary’ around the area you need with GeoPoints being translated into pixels using the toPixels method.

Store those points into a List<> of points, and you should be all set.