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.
Original language | English |
---|---|
Pages (from-to) | 858-875 |
Number of pages | 18 |
Journal | Engineering Computations (Swansea, Wales) |
Volume | 16 |
Issue number | 8 |
DOIs | |
Publication status | Published - 1999 |
Externally published | Yes |