The convex hull of a set of convex polygons

Abstract

The problem of computing the convex hull of a set of convex polygons is considered in two forms: (1) the polygons have the same number of vertices (the restricted case) and (2) the polygons have different numbers of vertices (the general case). The lower bound for the general case is first given. The restricted case is then considered briefly. The remainder of the paper is concerned with algorithms for the general case.

Keywords:

• Computational Geometry
• convex hull
• set of convex hulls
• cr

C.R. Categories:

• F.2.2
• I.3.5