A ShortStraw-based algorithm for corner finding in sketch-based interfaces

We present IStraw, a corner finding technique based on the ShortStraw algorithm. This new algorithm addresses deficiencies with ShortStraw while maintaining its simplicity and efficiency. We also develop an extension for ink strokes containing curves and arcs. We compare our algorithm against ShortStraw and two other state of the art corner finding approaches, MergeCF and Sezgin's scale space algorithm. Based on an all-or-nothing accuracy metric, IStraw shows significant improvements over these algorithms for ink strokes with and without curves.

Graphical AbstractWe present IStraw, a new corner finding technique based on an analysis of the ShortStraw algorithm. Our analysis reveals several limitations in ShortStraw and we develop techniques to overcome them. We also present an extension to our corner finding approach for dealing with ink strokes that contain curves and arcs. We compare our algorithm against other state of the art corner finding approaches including ShortStraw, MergeCF, and Sezgin's scale space algorithm. IStraw shows significant accuracy improvements over these algorithms for polyline ink strokes with and without curves, using an all-or-nothing accuracy metric.Figure optionsDownload high-quality image (69 K)Download as PowerPoint slideResearch Highlights
► Developed new corner finding technique based on ShortStraw Algorithm.
► Extended algorithm to support finding corners on curves.
► Found high all-or-nothing accuracy in several experiments comparing our algorithm with three state-of-the-art corner detectors.