14 research outputs found
Decomposition of Multiple Coverings into More Parts
Full text linkWe prove that for every centrally symmetric convex polygon Q, there exists a
constant alpha such that any alpha*k-fold covering of the plane by translates
of Q can be decomposed into k coverings. This improves on a quadratic upper
bound proved by Pach and Toth (SoCG'07). The question is motivated by a sensor
network problem, in which a region has to be monitored by sensors with limited
battery lifetime
Algorithms for bivariate medians and a fermat-torricelli problem for lines
Full text linkSpecial issue of selected papers from the 13th Canadian Conference on Computational Geometry (CCCG'01)info:eu-repo/semantics/publishe
Reconfiguring triangulations with edge flips and point moves
Full text linkWe examine reconfigurations between triangulations and near-triangulations of point sets. We give new bounds on the number of point moves and edge flips sufficient for any reconfiguration. We show that with O(n log n) edge flips and point moves, we can transform any geometric near-triangulation on n points to any other geometric near-triangulation on n possibly different points. This improves the previously known bound of O(n 2) edge flips and point moves. We then show that with a slightly more general point move, we can further reduce the complexity to O(n) point moves and edge flips
On Flat-State Connectivity of Chains with Fixed Acute Angles
Full text linkCCCG'02info:eu-repo/semantics/publishe
