How Reliable Are Practical Point-in-Polygon Strategies?

Authors:
Stefan Schirra
Affiliations:
Department of Computer Science, Otto von Guericke University, Magdeburg, Germany
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 10
Cited 2

An incremental angle point in polygon test

Graphics gems IV
Point in polygon strategies

Graphics gems IV
Towards exact geometric computation

Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Algorithm 112: Position of point relative to polygon

Communications of the ACM
Certification of Algorithm 112: Position of point relative to polygon

Communications of the ACM
Real-Time Rendering

Real-Time Rendering
Practical Point-in-Polygon Tests Using CSG Representations of Polygons

ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Heuristics for the Generation of Random Polygons

Proceedings of the 8th Canadian Conference on Computational Geometry
Classroom examples of robustness problems in geometric computations

Computational Geometry: Theory and Applications

A vision modeling framework for DHM using geometrically estimated FoV

Computer-Aided Design
Geo-casting of queries combined with coverage area reporting for wireless sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	0.04

Visualization

Abstract

We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. However, our experiments reveal that the tested code often fails for more challenging degenerate and also nearly degenerate queries.