Revisiting ShortStraw: improving corner finding in sketch-based interfaces

Paper
Xiong, Yiyan, and Joseph J. LaViola Jr. "Revisiting ShortStraw: improving corner finding in sketch-based interfaces." Proceedings of the 6th Eurographics Symposium on Sketch-Based Interfaces and Modeling. ACM, 2009.
Publication Link: http://dl.acm.org/citation.cfm?id=1572759

Summary

This paper proposes a set of improvements to a previous corner finding algorithm titled shortstraw. In this work, the authors address the following shortcomings from the previous version of shortstraw:
1. Rigid resampling rate
2. The occurrence and consequences of a false corner. The authors address this by using a two staged corner finding stage with aggressive and relaxed threshold values in respective order.
3. The use of a dynamic threshold based on length of line segment to avoid missed corners
4. Sharp noise resulting from resampling: They device an elegant solution using the the behavior of angles around a point on an arch vs a corner to discern the difference between the two.


Discussion

Pros

Addresses much of the shortcomings of the shortstraw paper.
The work is well presented. Their solution to sharpnoise is very elegant

Cons.

It makes the shortstraw solution a little more complicated to implement.
I think their results should have focused more on the specific errors they were trying to address and not the overall performance metrics. Example, isolate cases where shortstaw falsely detects a corner for reason x from the improvement list. Then show how many of those are correctly resolved in the new algorithm.