A point inclusion test algorithm for simple polygons

Authors:
Weishi Li;Eng Teo Ong;Shuhong Xu;Terence Hung
Affiliations:
Institute of High Performance Computing, Singapore;Institute of High Performance Computing, Singapore;Institute of High Performance Computing, Singapore;Institute of High Performance Computing, Singapore
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Year:
2005

Citing 7
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
The Problems of Accuracy and Robustness in Geometric Computation

Computer
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

ACM Transactions on Graphics (TOG)
A robust method for calculating the simplicity and orientation of planar polygons

Computer Aided Geometric Design
An incremental angle point in polygon test

Graphics gems IV
Point in polygon strategies

Graphics gems IV
Computational geometry in C (2nd ed.)

Computational geometry in C (2nd ed.)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for testing the relationship of a point and a simple polygon is presented. The algorithm employs a “visible edge” of the polygon from the point to determine whether the point is in the polygon or not according to the relationship of the orientation of the polygon and the triangle formed by the point and the visible edge. The algorithm is efficient and robust for floating point computation.