I'm trying to find a reasonably fast method for testing whether or not a point (x,y euclidean coordinate system) lies inside a (preferably convex, concave or complex - though different methods for each would be OK) compound polygon with edges consisting of line segments, arcs and/or elliptical arcs (elliptical arcs may be rotated in addition to having a start and end angle). I've already written the algorithms for edge and volumetric intersections of Points, Lines, Rays, LineSegments, Arcs, EllipticalArcs, Circles, Ellipses, Rectangle, Polygons and every combination thereof (also edge-based intersections of CompoundPolygons) - so have plenty of algorithms to call from, however I would prefer something a bit cleaner than testing the number of hits along rays cast from the test point to all surrounding points if that can be avoided. Does anyone know of a better solution to this problem?(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Algorithm for testing intersection of point and compound polygon

Loading...

Similar Threads - Algorithm testing intersection | Date |
---|---|

Limiting the placement of covering rectangle with smaller rectangles algorithm? | May 22, 2012 |

Robust Algorithm to Order Parallel Polylines | Feb 14, 2012 |

Algorithm for cutting a polygon into specific shapes | Jan 25, 2012 |

2D Circle and rectangle intersection tests | Sep 25, 2011 |

Triangulation of Torus, Algorithms for Calculating Simplicial Homology | Apr 24, 2010 |

**Physics Forums - The Fusion of Science and Community**