How Reliable Are Practical Point-in-Polygon Strategies?

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.

• Type: Conference
• Year: 2008
• Where: ESA
• Authors: Stefan Schirra
• Keywords: Algorithms, Challenging Degenerate, ESA 2008, Random Query Points, Simple Polygons