Given a finite set S of points in the Euclidean plane, we propose two kinds of line segment sets with endpoints in S. the first kind of line segment set is a subset of any triangulation of S, the second kind of line segment set is a subset of any minimum weight triangulation of S, and the two sets are disjoint. The computation of the two sets takes O(n3) time and O(n) space.