Alexander Neuhaus

most citedComputing the Fréchet distance of trees and graphs of bounded tree width

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2022

Stabbing balls with line segments and polygonal paths

Alexander Neuhaus, Dennis Rohde

We study the problem of ordered stabbing of $n$ balls (of arbitrary and possibly different radii, no ball contained in another) in $R^{d}$ , $d \geq 3$ , with either a directe…

cs.CG2020★ 2 cited

Computing the Fréchet distance of trees and graphs of bounded tree width

Maike Buchin, Amer Krivošija, Alexander Neuhaus

We give algorithms to compute the Fréchet distance of trees and graphs with bounded tree width. Our algorithms run in $O (n^{2})$ time for trees of bounded degree, and $O(n^2\sqrt{n \…