高德地图 如何查询该坐标是否在 我画的范围内 用到了”射线法“

m

//
// ddd.m
//
//
// Created by yaoyaodu on 13-8-15.
// Copyright (c) 2013年 yaoyaodu. All rights reserved.
//

#import "Raymethod.h"

@implementation Raymethod



/* gets extent of vertices */
void vertices_get_extent (const vertex_t* vl, int np,rect_t* rc)
{
int i;
if (np > 0){
rc->min_x = rc->max_x = vl[0].x; rc->min_y = rc->max_y = vl[0].y;
}else{
rc->min_x = rc->min_y = rc->max_x = rc->max_y = 0; /* =0 ? no vertices at all */
}
for(i=1; i<np;i++)
{
if(vl.x < rc->min_x) rc->min_x = vl.x;
if(vl.y < rc->min_y) rc->min_y = vl.y;
if(vl.x > rc->max_x) rc->max_x = vl.x;
if(vl.y > rc->max_y) rc->max_y = vl.y;
}
}
static int is_same(const vertex_t* l_start, const vertex_t* l_end, const vertex_t* p,const vertex_t* q)
{
double dx = l_end->x - l_start->x;
double dy = l_end->y - l_start->y;
double dx1= p->x - l_start->x;
double dy1= p->y - l_start->y;
double dx2= q->x - l_end->x;
double dy2= q->y - l_end->y;
return ((dx*dy1-dy*dx1)*(dx*dy2-dy*dx2) > 0? 1 : 0);
}
/* 2 line segments (s1, s2) are intersect? */
static int is_intersect(const vertex_t* s1_start, const vertex_t* s1_end,const vertex_t* s2_start, const vertex_t* s2_end)
{
return (is_same(s1_start, s1_end, s2_start, s2_end)==0 &&
is_same(s2_start, s2_end, s1_start, s1_end)==0)? 1: 0;
}
int pt_in_poly ( const vertex_t* vl, int np, /* polygon vl with np vertices */
const vertex_t* v)
{
int i, j, k1, k2, c;
rect_t rc;
vertex_t w;
if (np < 3)
return 0;
vertices_get_extent(vl, np, &rc);
if (v->x < rc.min_x v->x > rc.max_x v->y < rc.min_y v->y > rc.max_y)
return 0;
/* Set a horizontal beam l(*v, w) from v to the ultra right */
w.x = rc.max_x + DBL_EPSILON;
w.y = v->y;
c = 0; /* Intersection points counter */
for(i=0; i<np;i++)
{
j = (i+1) % np;
if(is_intersect(vl+i, vl+j, v, &w))
{
c++;
}
else if(vl.y==w.y)
{
k1 = (np+i-1)%np;
while(k1!=i && vl[k1].y==w.y)
k1 = (np+k1-1)%np;
k2 = (i+1)%np;
while(k2!=i && vl[k2].y==w.y)
k2 = (k2+1)%np;
if(k1 != k2 && is_same(v, &w, vl+k1, vl+k2)==0)
c++;
if(k2 <= i)
break;
i = k2;
}
}
return c%2;
}
@end