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

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.

Citation

Yue, Y., Murray, J.L., Corney, J.R. and Clark, D.E.R. (1999), "Convex hull of a planar set of straight and circular line segments", Engineering Computations, Vol. 16 No. 8, pp. 858-875. https://doi.org/10.1108/02644409910304086