2 papers
cs.CG2025
A Greedy Algorithm for Low-Crossing Partitions for General Set Systems
Mónika Csikós, Alexandre Louvet, Nabil Mustafa
Simplicial partitions are a fundamental structure in computational geometry, as they form the basis of optimal data structures for range searching and several related problems. Cur…
cs.CG2024
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii +4
We study spanners in planar domains, including polygonal domains, polyhedral terrain, and planar metrics. Previous work showed that for any constant , one could constru…