Abstract: In this paper, the common weakness of the current algorithms for seeking the convex hull of a finite 2D points set or Line Segment Set （include： polygons, closure broken lines, semi-closure broken lines,opening line segments, etc. ） is pointed out up to d

Key words: Convex hull algorithm, Isomorphic fundamental theorem of the convex hull, Minimum distributed domain, Immediate objects-judged