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…