数字地图制图9.pptVIP

In digital cartography and GIS, it is frequently necessary to know if a point locates within a certain polygon. If a raster data structure is used, this problem can be easily solved: let the whole polygon be 刡lackened?(be assigned with certain special gray value). And then using the position of the point (i, j), and test if the gray value of the pixel (i, j) to be the given special gray value for this polygon. If the answer is yes, this point locates within the polygon, otherwise, it locates outside of the polygon. Using vector data structure, it is more accurate but a little bit more complicated. The principle can be expressed as the following: first, to make a plumb line which starts from the given point (x0, y0). Second, to calculate and count all the intersection points between the plumb line and all the edges of the given polygon. If the number of the intersection points is odd, the point locates within the polygon; if the number of the intersection points is 0 or even, the point is outside of the polygon. Point-in-Polygon Test (1) (X0, Y0) (X, Y) ... number=0; for (i=0; i=n; i++) {calculate the intersection; if (Y Y0) { number++;} } If (int(number/2)*2+0.1 number) { inside the polygon;} else { outside the polygon; } ... Quasi-C language: It is possible to test the positional relations between a series of points and the given polygon. To be more efficient, some improvement can be adopted: First, to define the minimal X-coordinate Xmin, the minimal Y-coordinate Ymin, the maximal X-coordinate Xmax, and the maximal Y-coordinate Ymax of the given polygon. If ((X0 Xmax or X0 Xmin) or (Y0 Ymax or Y0 Ymin)) then there is no need to calculate and count the intersection points between the plumb line and all the edges of the polygon. The answer is: this point does not locate within the given polygon. Point-in-Polygon Test (2) (Xmin, Ymin) (Xmax, Ymax) (X0, Y0) Secondly, only those edges of the given polygon need to be taken for calcul