Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ESA
2008
Springer

favoriteEmaildiscussreport

92views Algorithms» more ESA 2008»

How Reliable Are Practical Point-in-Polygon Strategies?

13 years 6 months ago

How Reliable Are Practical Point-in-Polygon Strategies?

Download wwwisg.cs.uni-magdeburg.de

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.

Stefan Schirra

Real-time Traffic

Algorithms | Challenging Degenerate | ESA 2008 | Random Query Points | Simple Polygons |

claim paper

Related Content

» Low cost prototyping part 1 or how to produce better ideas faster by getting user reaction...

» NBTI resilient circuits using adaptive body biasing

» PeertoPeer Storage Systems A Practical Guideline to be Lazy

» Optimal ISP subscription for Internet multihoming algorithm design and implication analysi...

» A measurementbased analysis of multihoming

» The EnterpriseWeb portal for lifecycle support

» Using an autonomous cube for basic navigation and input

» Error rates for multivariate outlier detection

» The Long Term Fate of Our Digital Belongings Toward a Service Model for Personal Archives

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	ESA
Authors	Stefan Schirra

Comments (0)