Introduction - If you have any usage issues, please Google them yourself
This code is described in "Computational Geometry in C" (Second Edition),
Chapter 7. It is not written to be comprehensible without the
explanation in that book.
This program reads a polygon P followed by query points from stdin.
The input format is:
n
x0 y0
x1 y1
...
xn-1 yn-1
qx qy
qx qy
qx qy
...
For each query point q, InPoly returns one of four char s:
i : q is strictly interior to P
o : q is strictly exterior to P
v : q is a vertex of P
e : q lies on the relative interior of an edge of P
These represent mutually exclusive categories.
For an explanation of the code, see Chapter 7 of
"Computational Geometry in C (Second Edition)."
Packet : 1985489inpoly.rar filelist
inpoly\i.28
inpoly\i.28.verts
inpoly\inpoly.c
inpoly\Makefile
inpoly\README.inpoly
inpoly