22 citations · 23 across the 8 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.CG2021
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union
Marvin Künnemann, André Nusser
We revisit the classical problem of determining the largest copy of a simple polygon that can be placed into a simple polygon . Despite significant effort, known algorithms…
cs.CG2021
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance
Karl Bringmann, Anne Driemel, André Nusser +1
We study the -approximate near neighbor problem under the continuous Fréchet distance: Given a set of polygonal curves with vertices, a radius , and a parameter $k…
cs.DS2021
Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
David Coudert, André Nusser, Laurent Viennot
Hyperbolicity is a graph parameter which indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networkin…