java判断点在面内射线法_判断点在多边形内部 - 射线法

Statement of the Problem

Several drawing applications allow us to draw polygons and almost all of them allow us to fill them with some color. The task of filling a polygon reduces to knowing which points are inside it, so programmers have to colour only those points.

You're expected to write a program which tells us if a given point lies inside a given polygon described by the coordinates of its vertices. You can assume that if a point is in the border of the polygon, then it is in fact inside the polygon.

Input Format

The input file may contain several instances of the problem.

Each instance consists of: (i) one line containing integers N, 0 < N

< 100 and M, respectively the number of vertices of the polygon and

the number of points to be tested. (ii) N lines, each containing a pair

of integers describing the coordinates of the polygon's vertices; (iii) M

l