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

Yong Yue, J. L. Murray, J. R. Corney, D. E R Clark

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 languageEnglish
Pages (from-to)858-875
Number of pages18
JournalEngineering Computations: International Journal for Computer Aided Engineering and Software
Volume16
Issue number8
DOIs
Publication statusPublished - 1999

Fingerprint Dive into the research topics of 'Convex hull of a planar set of straight and circular line segments'. Together they form a unique fingerprint.

  • Cite this