title: Shortest Path INSIDE a Polygon Algorithm/Pseudo Code
body: <p>I have a polygon (in PHP) represented by an array of X,Y points.  I wish to find the shortest path inside the polygon between point A and point B.  In practical terms, I have an arbitrary area, defined as a simple polygon, that I wish to know the distance through (e.g. think of it as a polygon representing a trail - I want to estimate how long the trail is).</p>
  
  <p>Looking for pseudo code or some tips on where to get started.  I have scoured the internet and seem to be out of luck, other than some hard to understand papers on triangulation and funnel algorithms.</p>