I am looking for an algorithm to create geofence and check if a device enters a fence. I looked at a point in polygonal algorithms (ray count and winding number), but are there any algorithms that can be applied to the circle and to any irregular shapes? An important limitation is time efficiency.
Thank.
The circles of zeros are quite light (at least if you assume a locally flat surface) - just the absolute distance from the point.
, , - , , , , , , .
- ?
ps . , ?
c, :
http://alienryderflex.com/polygon/
, , r-.
But the bottom line is that for both geometric correctness and efficiency, the winding number algorithm should always be preferable for determining whether a point is included in a polygon.