2 papers
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.CG2023
On Mergable Coresets for Polytope Distance
Benwei Shi, Aditya Bhaskara, Wai Ming Tai +1
We show that a constant-size constant-error coreset for polytope distance is simple to maintain under merges of coresets. However, increasing the size cannot improve the error boun…