For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...
Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
In this paper we study polygonal transformations through an operation called deflation. It is known that some families of polygons deflate infinitely for given deflation sequences...
A set of n colored objects (points/hyperboxes) lie in IRd . Each object has a weight associated with it. Given a query orthogonal range q, for each distinct color c of the objects...