On Mergable Coresets for Polytope Distance
arXiv:2311.05651v11 citationsh-index: 7
Originality Synthesis-oriented
AI Analysis
This work addresses coreset maintenance for computational geometry, but it appears incremental as it builds on existing coreset methods without introducing a new paradigm.
The paper tackled the problem of maintaining coresets for polytope distance under merges, showing that constant-size coresets with constant error are easy to maintain, but increasing size does not significantly improve error bounds.
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 bound significantly beyond that constant.