An incremental computation of convex hull of planar line intersections

Abstract

We present an incremental convex hull computing algorithm for planar straight line intersections. Updating is done by finding the enclosing lines of the input line and their pairwise intersection points. © 1990.