1 citations · 1 across the 2 of their papers we have counts for
6 papers
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
Daniel Funke, Demian Hespe, Peter Sanders +2
In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or…
A Sweep-plane Algorithm for Calculating the Isolation of Mountains
Daniel Funke, Nicolai Hüning, Peter Sanders
One established metric to classify the significance of a mountain peak is its isolation. It specifies the distance between a peak and the closest point of higher elevation. Peaks w…
Efficient Yao Graph Construction
Daniel Funke, Peter Sanders
Yao graphs are geometric spanners that connect each point of a given point set to its nearest neighbor in each of cones drawn around it. Yao graphs were introduced to construct…
Load-Balancing for Parallel Delaunay Triangulations
Daniel Funke, Peter Sanders, Vincent Winkler
Computing the Delaunay triangulation (DT) of a given point set in is one of the fundamental operations in computational geometry. Recently, Funke and Sanders (2017)…
Communication-free Massively Distributed Graph Generation
Daniel Funke, Sebastian Lamm, Ulrich Meyer +5
Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis…
Deciding Reachability for 3-Dimensional Multi-Linear Systems
Olga Tveretina, Daniel Funke
This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of region…