AbstractÐThe faces in a 2D line drawing of an object provide important information for the reconstruction of its 3D geometry. In this paper, a graph-based optimization method is proposed for identifying the faces in a line drawing. The face identification is formulated as a maximum weight clique problem. This formulation is proven to be equivalent to the formulation proposed by Shpitalni and Lipson in [1] . The advantage of our formulation is that it enables us to develop a much faster algorithm to find the faces in a drawing. The significant improvement in speed is derived from two algorithms provided in this paper: The depth-first graph search for quickly generating possible faces from a drawing and the maximum weight clique finding for obtaining the optimal face configurations of the drawing. The experimental results show that our algorithm generates the same results of face identification as Shpitalni and Lipson's, but is much faster when dealing with objects of more than 20 faces.
Liu and Lee REF revisited the problem tackled by Shpitalni and Lipson.
Graph-based method for face identification from a single 2D line drawing
IEEE Trans. Pattern Anal. Mach. Intell.
IEEE Trans. Pattern Anal. Mach. Intell.
Computer Science