Convex hull of a planar set of straight and circular line segments
Yong Gang Yue, J.L. Murray, Jonathan Corney, D. E. R. Clark · Engineering Computations · 1999
Abstract The problem of constructing the convex hull of a set of points and of curvilinear segments arises in many applications of geometric analysis. Although there has been much work on algorithms for the convex hull of a finite point set, there has been less on methods for dealing with circular line segments and the implementation issues. This paper describes a new method for finding the convex hull of a planar set of straight and circular line segments. It then concentrates on the implementation of the algorithm.