Analysis of “Eliminating False Positives During Corner Finding by Merging Similar Segments”
Comments Made Elsewhere:
Summary:
Very short paper. Using speed and curvature, go through and find every possible corner (unless too close together, and also move the one with the smallest curvature).� Next, assuming that the corners of small stoke segments are false positives, attempt to merge them with their neighbors, only doing so if the error is less.
Discussion:
Considering my discussion in the last blog post, here’s a solution for corner finding that doesn’t appear to require resampling.� It looks to be a very fast solution, too.� Seems like they could have implemented Kim&Kim’s local convexity as another heurisic of the initial fit.