2007Journal of Engineering GraphicsRequires access

Algorithm for Point in Polygon

Xun Yao

Open publisher page 0 citations

Abstract

The traditional algorithm for checking point in polygon is not convenience,then a convenience algorithm——sloping line method is presented.The characteristic of this algorithm is that the sloping line did not match together with any vertex or edge of polygon,no special situation needs to deal with,the computation time is decreased.First,to make a sloping line from point,and then to count its crossing points with polygon,if the amount of crossing points is odd,then the point is in polygon,otherwise,the point is out of polygon.It is proved that this algorithm is an effective and robust one,and suitable for most cases.

About this research paper

What this paper is about

The traditional algorithm for checking point in polygon is not convenience,then a convenience algorithm——sloping line method is presented.The characteristic of this algorithm is that the sloping line did not match together with any vertex or edge of polygon,no special situation needs to deal with,the computation time is decreased.First,to make a sloping line from point,and then to count its crossing points with polygon,if the amount of crossing points is odd,then the point is in polygon,otherwise,the point is out of polygon.It is proved that this algorithm is an effective and robust one,and suitable for most cases.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The traditional algorithm for checking point in polygon is not convenience,then a convenience algorithm——sloping line method is presented.The characteristic of this algorithm is that the sloping line did not match together with any vertex or edge of polygon,no special situation needs to deal with,the computation time is decreased.First,to make a sloping line from point,and then to count its crossing points with polygon,if the amount of crossing points is odd,then the point is in polygon,otherwise,the point is out of polygon.It is proved that this algorithm is an effective and robust one,and suitable for most cases.

Key concepts: Polygon (computer graphics), Point in polygon, Polygon covering, Point (geometry), Rectilinear polygon, Simple polygon, Visibility polygon, Star-shaped polygon

Related papers

Back to paper searchBrowse research topicsOriginal source
Algorithm for Point in Polygon — Research Paper | ScholarLens