1 citations · 2 across the 2 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2023★ 1 cited
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou
We present a generalization of a combinatorial result by Aggarwal, Guibas, Saxe and Shor [Discrete & Computational Geometry, 1989] on a linear-time algorithm that selects a constan…
cs.CG2018★ 1 cited
Deletion in abstract Voronoi diagrams in expected linear time and related problems
Kolja Junginger, Evanthia Papadopoulou
Updating an abstract Voronoi diagram after deletion of one site in linear time has been a well-known open problem; similarly, for concrete Voronoi diagrams of non-point sites. In t…