Figural closure is an important form of visual structure found in sketches, graphics, and formal drawings. This paper outlines an effective algorithm for finding closed or nearly closed, convex or nearly convex paths in precisely or imprecisely drawn line art. We start with a graph of curvilinear fragments whose proximal endpoints form junctions. The key problem is to manage the search of possible path continuations through junctions in an effort to find paths satisfying global criteria for closure and figural quality. We identify constraints on the ways that junctions arise in line drawings that permit effective guiding and pruning of search.
Back to Eric Saund's Papers Page.
Back to Eric Saund's Home Page.