Skip to main content
Conference Proceedings

How reliable are practical point-in-polygon strategies?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5193 LNCS 744-755
DOI: 10.1007/978-3-540-87744-8_62
18Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Schirra, S. (2008). How reliable are practical point-in-polygon strategies? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 744–755). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free