Christian Knauer

collaborators

2 papers

cs.CG2025

Better Late than Never: the Complexity of Arrangements of Polyhedra

Boris Aronov, Sang Won Bae, Sergio Cabello +4

Let $A$ be the subdivision of $R^{d}$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $A$ has combinatorial complexity $O(m^{\l…

cs.CG2023

Geometric Matching and Bottleneck Problems

Sergio Cabello, Siu-Wing Cheng, Otfried Cheong +1

Let $P$ be a set of at most $n$ points and let $R$ be a set of at most $n$ geometric ranges, such as for example disks or rectangles, where each $p \in P$ has an associated supply…