6 citations · 6 across the 9 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs
Ivor van der Hoog, Irene Parada, Eva Rotenberg
A directed graph is upward planar if it admits a planar embedding such that each edge is -monotone. Unlike planarity testing, upward planarity testing is NP-hard except in r…
cs.DS2022
Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity
Jacob Holm, Ivor van der Hoog, Eva Rotenberg
We study dynamic planar graphs with vertices, subject to edge deletion, edge contraction, edge insertion across a face, and the splitting of a vertex in specified corners. We d…
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…