1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024★ 1 cited
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…
cs.DS2023
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…
cs.DS2019
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)…