CCCG
2010
13 years 5 months ago
2010
I first met Paul Erd
CCCG
2010
13 years 5 months ago
2010
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 ...
CCCG
2010
13 years 5 months ago
2010
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
CCCG
2010
13 years 5 months ago
2010
We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper un...
CCCG
2010
13 years 5 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
CCCG
2010
13 years 5 months ago
2010
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...
CCCG
2010
13 years 5 months ago
2010
d Abstract) Debajyoti Mondal , Rahnuma Islam Nishat , Md. Saidur Rahman , and Muhammad Jawaherul Alam
CCCG
2010
13 years 5 months ago
2010
CCCG
2010
13 years 5 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
CCCG
2010
13 years 5 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...