This paper considers the problem of finding a simple polygon containing a given set of line segments as its edges. An algorithm is given for the case where at least one of endpoints of each line segment appears on the convex hull of the set.