title: Ramer-Peucker-Douglas algorithm in polar coordinates
body: <p>I have points in polar coordinates (basically, I have a radar graph), and I want to eliminate points that are unnecessary the way Ramer-Peucker-Douglas does it in cartesian coordinates.</p>
  
  <p>By unnecessary points I still mean a point B between points A and C and "close" to the line joining A to C, just like I the original Ramer-Peucker-Douglas algorithm (How close is "close" is an input parameter to the algorithm).</p>
  
  <p>Any hints?</p>