MergeCF

Geometric recognizers require shapes to be defined from a set of primitives. Constraining a user to draw in only disjoint primitives makes sketching less natural, so corner finding, or vertex detection, is used during stroke preprocessing to automatically split any drawn strokes into primitives. In this paper, we present a new corner finding algorithm called MergeCF that is based on merging like stroke segmentations together in order to eliminate false positive corners. We compare MergeCF to two benchmark corner finders with substantial improvements in both polyline and complex fits.

Authors

Aaron Wolin
Brandon Paulson
Tracy Hammond

User Study

Complex and Polyline Study

Publications

• Wolin, A., Paulson, B., Hammond, T. (2008). Eliminating False Positives During Corner Finding by Merging Similar Segments. AAAI Student Abstract. July 2008. [PDF]