An Algorithm for Computing the Convex Hull of a Set of Imprecise Line Segment Intersection
Keivan Borna, Morteza Asadi · International Journal of Open Problems in Computer Science and Mathematics · 2014
Data imprecision constitutes an important gap between theory and practice in computational geometry. A lot of research about imprecision in computational geometry is directed at computing the convex hull of imprecise points rather than imprecise line segment intersection. In this paper we introduce an algorithm to construct the convex hull for a set of imprecise line segment intersection in time.