ShortStraw: A Simple and Effective Corner Finder for Polylines

Authors: Aaron Wolin, Tracy Hammond

Comment:
1. Daniel's blog
Summary:
Resampling - Interspacing distance = bounding box diagonal by a constant(40).
Corner Finding -
* for each point 'p' in the stroke, find the distance between (p-w,p+w). This distance is short when the point 'p' is the corner.
* find the median of all the distances. threshold for corner is fixed at t= median * 0.95.
* if straw(k) if below this threshold, then its a corner.
* Run a line test on 2 consecutive corners (0.95 threshold). if the corners does not pass the line test, then there are additional corners between them. So the threshold t is relaxed, to include the corners. Run this step until the segment between the corners passes the line test.
* Run a collinearity test on consecutive 3 corners.

Discussion:
a clever way to find corners in a stroke. I dont know how effective will relaxing the threshold for outlying corners will be. It might raise false positives.