# Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons

Let P be a crossing-free polygon and 𝒞 a set of shortcuts, where each shortcut is a directed straight-line segment connecting two vertices of P. A shortcut hull of P is another crossing-free polygon that encloses P and whose oriented boundary is composed of elements from 𝒞. Shortcut hulls find their application in geo-related problems such as the simplification of contour lines. We aim at a shortcut hull that linearly balances the enclosed area and perimeter. If no holes in the shortcut hull are allowed, the problem admits a straight-forward solution via shortest paths. For the more challenging case that the shortcut hull may contain holes, we present a polynomial-time algorithm that is based on computing a constrained, weighted triangulation of the input polygon's exterior. We use this problem as a starting point for investigating further variants, e.g., restricting the number of edges or bends. We demonstrate that shortcut hulls can be used for drawing the rough extent of point sets as well as for the schematization of polygons.

• 4 publications
• 7 publications
• 16 publications
• 9 publications
research
11/17/2022

### Crossing and intersecting families of geometric graphs on point sets

Let S be a set of n points in the plane in general position. Two line se...
research
08/18/2019

### On the 2-colored crossing number

Let D be a straight-line drawing of a graph. The rectilinear 2-colored c...
research
08/23/2019

### Variants of the Segment Number of a Graph

The segment number of a planar graph is the smallest number of line segm...
research
03/16/2022

### Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals

We consider drawings of graphs in the plane in which vertices are assign...
research
08/18/2017

### Non-crossing paths with geographic constraints

A geographic network is a graph whose vertices are restricted to lie in ...
research
09/21/2018

### Polyline Drawings with Topological Constraints

Let G be a simple topological graph and let Γ be a polyline drawing of G...
research
07/30/2020

### Synchronized Planarity with Applications to Constrained Planarity Problems

We introduce the problem Synchronized Planarity. Roughly speaking, its i...