6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.CG2022
Efficient Fréchet distance queries for segments
Maike Buchin, Ivor van der Hoog, Tim Ophelders +3
We study the problem of constructing a data structure that can store a two-dimensional polygonal curve , such that for any query segment one can efficiently comp…
cs.CG2019★ 6 cited
Smoothed Analysis of Order Types
Ivor van der Hoog, Tillmann Miltzow, Martijn van Schaik
Consider an ordered point set , its order type (denoted by ) is a map which assigns to every triple of points a value in based on whether the…