6 citations · 6 across the 9 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CG2026
Computing Planar Convex Hulls with a Promise
Sepideh Aghamolaei, Kevin Buchin, Timothy M. Chan +5
Computing the convex hull of a planar -point set is one of the most fundamental problems in computational geometry. It has an lower bound in the algebraic comp…
cs.CG2026
Engineering Fully Dynamic Convex Hulls
Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg
We present a new fully dynamic algorithm for maintaining convex hulls under insertions and deletions while supporting geometric queries. Our approach combines the logarithmic metho…