Showing cs.CGShow all
3 papers · 1 filter
cs.CG2025
Better Late than Never: the Complexity of Arrangements of Polyhedra
Boris Aronov, Sang Won Bae, Sergio Cabello +4
Let be the subdivision of induced by convex polyhedra having facets in total. We prove that has combinatorial complexity $O(m^{\l…
cs.CG2023
Geometric Matching and Bottleneck Problems
Sergio Cabello, Siu-Wing Cheng, Otfried Cheong +1
Let be a set of at most points and let be a set of at most geometric ranges, such as for example disks or rectangles, where each has an associated supply…
cs.CG2021
Packing d-dimensional balls into a d+1-dimensional container
Helmut Alt, Sergio Cabello, Otfried Cheong +2
In this article, we consider the problems of finding in dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex b…