66 search results - page 11 / 14 » cccg 2010 |
CCCG
2010
14 years 11 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
14 years 11 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
14 years 11 months ago
2010
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...
CCCG
2010
14 years 11 months ago
2010
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
CCCG
2010
14 years 11 months ago
2010
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...