Convex hulls of piecewise-smooth Jordan curves

https://doi.org/10.1016/0196-6774(87)90028-9Get rights and content

Abstract

Several linear-time algorithms for finding the convex hull of a simple polygon in the plane are known. This paper extends a linear-time algorithm for polygons to a linear-time algorithm for input that includes smooth, convex, curved edges, such as conic sections.

References (11)

There are more references available in the full text version of this article.

Cited by (35)

  • Precise convex hull computation for freeform models using a hierarchical Gauss map and a Coons bounding volume hierarchy

    2014, CAD Computer Aided Design
    Citation Excerpt :

    Early convex hull algorithms considered only discrete objects such as points, lines, polygons, or polyhedra [1]. Theoretical algorithms (with no implementation) have been designed for planar curves [5–7]. Practical algorithms with full implementation were developed in [2,8,4].

  • Efficient convex hull computation for planar freeform curves

    2011, Computers and Graphics (Pergamon)
    Citation Excerpt :

    Early algorithms considered only discrete objects such as points, lines, polygons, or polyhedra [3,5,10,11,17–19]. Some theoretical algorithms were developed for planar curved regions [4,6,20]; however, they assumed certain curve operations which are difficult to implement in an efficient and robust way. In particular, the algorithms are based on rather expensive curve operations such as common tangent computation for pairs of curve segments.

  • A smooth, obstacle-avoiding curve

    2006, Computers and Graphics (Pergamon)
    Citation Excerpt :

    A polygonal obstacle can be treated efficiently by representing it by the vertices of its convex hull. Even an obstacle with curved sides can be bounded by a convex polygon (see Fig. 6 and [15]). There is probably no general algorithm to find the “best” bounding convex polygon, but individual cases are often treated easily.

View all citing articles on Scopus

Some of this work was done while A. A. Schäffer was a summer employee of AT & T Bell Laboratories; during the academic year his work is funded by a National Science Foundation Graduate Fellowship and by National Science Foundation Grant NSFDCR 83-00984.

View full text