A header-only file providing a template-based solution for determining if a point resides within a three-dimensional non-complex polygon. This solution is self-contained and does not rely on external libraries, with the only dependency being the inclusion of <vector> and <algorithm>.
- C++ 11 Standard and above
- Standard Template Library (STL)
The stress test results for the PointInPolygon function applied to a 3D planar polygon with 180.000 test points. More test results can be found here
The solution works for all kinds of 3D non-complex polygons, concave or convex, open or closed.
- Windows
- Linux
- macOS
Copy PointInPolygon.h to your project and include the file.
#include <iostream>
#include "PointInPolygon.h"
using namespace pip;
int main()
{
std::vector<Point> polygon;
polygon.emplace_back(0.0f, 0.0f, 0.0f);
polygon.emplace_back(2.0f, 0.0f, 0.0f);
polygon.emplace_back(2.0f, 2.0f, 0.0f);
polygon.emplace_back(0.0f, 2.0f, 0.0f);
const Point p = {1.0f , 1.0f , 0.0f};
if( pip::pointInPolygon(polygon, p) )
std::cout << "Point inside polygon!\n";
else
std::cout << "Point outside polygon!\n";
return 0;
}