Relative convex hull

The relative convex hull of a finite set of points in a simple polygon

In discrete geometry and computational geometry, the relative convex hull or geodesic convex hull is an analogue of the convex hull for the points inside a simple polygon or a rectifiable simple closed curve.

Definition

Let [math]\displaystyle{ P }[/math] be a simple polygon or a rectifiable simple closed curve, and let [math]\displaystyle{ X }[/math] be any set enclosed by [math]\displaystyle{ P }[/math]. A geodesic between two points in [math]\displaystyle{ P }[/math] is a shortest path connecting those two points that stays entirely within [math]\displaystyle{ P }[/math]. A subset [math]\displaystyle{ K }[/math] of the points inside [math]\displaystyle{ P }[/math] is said to be relatively convex, geodesically convex, or [math]\displaystyle{ P }[/math]-convex if, for every two points of [math]\displaystyle{ K }[/math], the geodesic between them in [math]\displaystyle{ P }[/math] stays within [math]\displaystyle{ K }[/math]. Then the relative convex hull of [math]\displaystyle{ X }[/math] can be defined as the intersection of all relatively convex sets containing [math]\displaystyle{ X }[/math].

Equivalently, the relative convex hull is the minimum-perimeter weakly simple polygon in [math]\displaystyle{ P }[/math] that encloses [math]\displaystyle{ X }[/math]. This was the original formulation of relative convex hulls, by (Sklansky Chazin). However this definition is complicated by the need to use weakly simple polygons (intuitively, polygons in which the polygon boundary can touch or overlap itself but not cross itself) instead of simple polygons when [math]\displaystyle{ X }[/math] is disconnected and its components are not all visible to each other.

Special cases

Finite sets of points

(Toussaint 1986), who provided an efficient algorithm for the construction of the relative convex hull for finite sets of points inside a simple polygon. With subsequent improvements in the time bounds for two subroutines, finding shortest paths between query points in a polygon, and polygon triangulation, this algorithm takes time [math]\displaystyle{ O(p + n\log(p+n)) }[/math] on an input with [math]\displaystyle{ n }[/math] points in a polygon with [math]\displaystyle{ p }[/math] vertices. It can also be maintained dynamically in sublinear time per update.

The relative convex hull of a finite set of points is always a weakly simple polygon, but it might not actually be a simple polygon, because parts of it can be connected to each other by line segments or polygonal paths rather than by regions of nonzero area.

Simple polygons

For relative convex hulls of simple polygons, an alternative but equivalent definition of convexity can be used. A simple polygon [math]\displaystyle{ P }[/math] within another simple polygon [math]\displaystyle{ Q }[/math] is relatively convex or [math]\displaystyle{ Q }[/math]-convex if every line segment contained in [math]\displaystyle{ Q }[/math] that connects two points of [math]\displaystyle{ P }[/math] lies within [math]\displaystyle{ P }[/math]. The relative convex hull of a simple polygon [math]\displaystyle{ P }[/math] within [math]\displaystyle{ Q }[/math] can be defined as the intersection of all [math]\displaystyle{ Q }[/math]-convex polygons that contain [math]\displaystyle{ P }[/math], as the smallest [math]\displaystyle{ Q }[/math]-convex polygon that contains [math]\displaystyle{ P }[/math], or as the minimum-perimeter simple polygon that contains [math]\displaystyle{ P }[/math] and is contained by [math]\displaystyle{ Q }[/math].

(Klette 2010) generalizes linear time algorithms for the convex hull of a simple polygon to the relative convex hull of one simple polygon within another. The resulting generalized algorithm is not linear time, however: its time complexity depends on the depth of nesting of certain features of one polygon within another. In this case, the relative convex hull is itself a simple polygon. Alternative linear time algorithms based on path planning are known.

A similar definition can also be given for the relative convex hull of two disjoint simple polygons. This type of hull can be used in algorithms for testing whether the two polygons can be separated into disjoint halfplanes by a continuous linear motion, and in data structures for collision detection of moving polygons.

Higher dimensions

The definition of relative convex hulls based on minimum enclosure does not extend to higher dimensions, because (even without being surrounded by an outer shape) the minimum surface area enclosure of a non-convex set is not generally convex. However, for the relative convex hull of a connected set within another set, a similar definition to one for simple polygons can be used. In this case, a relatively convex set can again be defined as a subset of the given outer set that contains all line segments in the outer set between pairs of its points. The relative convex hull can be defined as the intersection of all relatively convex sets that contain the inner set.