Decision point and polygonal state (location)

xiaoxiao2021-03-06 37

The last article is considered for no circumference, please give the principle of the principle to do the right to the right, if the point of the ray and the polygon intersect, the point is in the polygon. Whether to intersect the judgment: 1. It is judged that the left or right side of the side (also possible on the extension line of the line segment) 2. The Y value of the judgment point is in the line segment between the two endpoint Y values (the left left) and if it is an odd number, the special case within the polygon is handled: the first case, the second case is considered No intersection (countless intersection), on the extension of the line segment

code show as below:

///

/// 0: Outside the polygon 1: In the polygon 5: point on the side of the polygon

Public Static Int PtinPolygon (MAPPOINT MPPT, MAPPOLYGON PLY)

{

INT IRIGHTCROSS = 0; // Number of intersecting the rays and polygon

Mappoint mpnext = NULL; for (int i = 0; i mpnext.y) {if (mppt.y <= ply [i] .y && mppt.y> = mpnext.y) {// Intersection IF (IRE == 1) IRIGHTCROSS ;}} else {i (mppt.y <= mpnext.y && mppt.y> = ply [i] .y <= mpnext.y && mppt.y> = ply}}} Irightcross ;}}}} Return IRIGHTCROSS% 2;} How to post a little bit?

转载请注明原文地址:https://www.9cbs.com/read-61771.html

9cbs

New Post(0)