Convex hull of a planar set of straight and circular line segments

The problem of constructing the convex hull of a set of points and of curvi linear segments arises in many applications of geometric analysis Although there has been much work on algorithms for the convex hull of a finite Poin t set, there has been less on methods for dealing with circular line segmen ts and the implementation issues This paper describes a new method for find ing the convex hull of a planar set of straight and circular line segments. It then concentrates on the implementation of the algorithm.