Sort, Merge, Repeat: An Algorithm for Effectively Finding Corners in Hand-sketched Strokes

Wolin, A.; Paulson, B.; Hammond, T.

Sort, Merge, Repeat: An Algorithm for Effectively Finding Corners in Hand-sketched Strokes

Files

093-100.pdf (317.92 KB)

Date

2009

Authors

Wolin, A.
Paulson, B.
Hammond, T.

Publisher

The Eurographics Association

Abstract

Free-sketch recognition systems attempt to recognize freely-drawn sketches without placing stylistic constraints on the users. Such systems often recognize shapes by using geometric primitives that describe the shape's appearance rather than how it was drawn. A free-sketch recognition system necessarily allows users to draw several primitives using a single stroke. Corner finding, or vertex detection, is used to segment these strokes into their underlying primitives (lines and arcs), which in turn can be passed to the geometric recognizers. In this paper, we present a new multi-pass corner finding algorithm called MergeCF that is based on continually merging smaller stroke segments with similar, larger stroke segments in order to eliminate false positive corners. We compare MergeCF to two benchmark corner finders with substantial improvements in corner detection.

        @inproceedings{:10.2312/SBM/SBM09/093-100
,
booktitle = {EUROGRAPHICS Workshop on Sketch-Based Interfaces and Modeling
},
editor = {Cindy Grimm and Joseph J. LaViola, Jr.
},
title = {{Sort, Merge, Repeat: An Algorithm for Effectively Finding Corners in Hand-sketched Strokes
}},
author = {Wolin, A. and 
Paulson, B. and 
Hammond, T.
},
year = {2009
},
publisher = {The Eurographics Association
},
ISSN = {1812-3503
},
ISBN = {978-3-905674-19-4
},
DOI = {/10.2312/SBM/SBM09/093-100
}
}