1

Topic: Point hit in a polygon, including edges

What algorithm to use for check of hit of a point in a polygon that points precisely on edges would be considered as a polygon part? Standard algorithms, namely count of an amount of intersections of a ray with edges and count of turns round a point (too it is reduced to search of edges intersecting a ray) do not allow to include "simply" an edge in a polygon, by default a part of edges gets to it, and the part - is not present. It is possible to register separately a case of hit of a point precisely on an edge that I and made, but it looks ugly. More beautiful looks beforehand to break  into convex polygons, and then to check up on hit in everyone. There very simply to adjust where to carry points on edges. But not so it would be desirable to do preliminary handling of a polygon. Can be eat any more beautiful variants?

2

Re: Point hit in a polygon, including edges

Hello, Roma Mik, you wrote: > What algorithm to use for check of hit of a point in a polygon that  precisely on edges would be considered as a polygon part. > Standard algorithms, namely count of an amount of intersections of a ray with edges and count of turns round a point (too it is reduced to search of edges intersecting a ray) do not allow to include "simply" an edge in a polygon, by default a part of edges gets to it, and the part - is not present. It is possible to register separately a case of hit of a point precisely on an edge that I and made, but it looks ugly. > More beautiful looks beforehand to break  into convex polygons, and then to check up on hit in everyone. There very simply to adjust where to carry points on edges. But not so it would be desirable to do preliminary handling of a polygon. The stupid decision in a forehead - in disputable cases (if diagnosed missing) in addition to check up hit in polygon edges. I.e. Check of intersection of a segment and point will be added.