28 citations · 62 across the 18 of their papers we have counts for
8 papers · 1 filter
Consistent Simplification of Polyline Tree Bundles
Yannick Bosch, Peter Schäfer, Joachim Spoerhase +2
The Polyline Bundle Simplification (PBS) problem is a generalization of the classical polyline simplification problem. Given a set of polylines, which may share line segments and p…
Simplification of Polyline Bundles
Joachim Spoerhase, Sabine Storandt, Johannes Zink
We propose and study a generalization to the well-known problem of polyline simplification. Instead of a single polyline, we are given a set of polylines possibly sharing so…
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar +2
We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizon…
Approximation Schemes for Geometric Coverage Problems
Steven Chaplick, Minati De, Alexander Ravsky +1
In their seminal work, Mustafa and Ray (2009) showed that a wide class of geometric set cover (SC) problems admit a PTAS via local search -- this is one of the most general approac…
Colored Non-Crossing Euclidean Steiner Forest
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann +3
Given a set of -colored points in the plane, we consider the problem of finding trees such that each tree connects all points of one color class, no two trees cross, and the…
On Monotone Drawings of Trees
Philipp Kindermann, André Schulz, Joachim Spoerhase +1
A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a mon…