---
title: "GIS 点在多边形内"
author: "cjx186"
date: "2009-03-16T11:21:00Z"
tags: []
slug: "gis"
draft: false
lastmod: "2009-08-22T20:55:20Z"
id: 349686
url: "https://xml.iteye.com/blog/349686"
---

```c++
//这个算法是参考计算机图形学书上的算法得来的，可以说十分简单高效。
//calc point in ploygon or not 
bool PIP(CPoint p,const CPoint data[],int n){
    bool flag=0;
    for(int i=0;i<n;i++){
        if(p.y<data[i].y&&p.y<data[(i+1)%n].y)
            continue;
        if(data[i].x<=p.x&&data[(i+1)%n].x<=p.x)
            continue;
        int dx=data[(i+1)%n].x-data[i].x;
        int dy=data[(i+1)%n].y-data[i].y;
        float t=float(p.x-data[i].x)/dx;//求得交点的t值
         float y=t*dy+data[i].y;
        if(y<=p.y&&t>=0&&t<=1)
        flag=!flag;
    }
    return flag;
}
```