The problem of finding the convex hull of the intersection points of random lines was studied in [dt] and [new], and algorithms with expected linear time were found. We improve the previous results of the model in [dt] by giving a universal algorithm for a wider range of distributions.