47 search results - page 3 / 10 » cccg 2008 |
CCCG
2008
13 years 6 months ago
2008
We construct a sequence of convex polyhedra on n vertices with the property that, as n, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the frac
CCCG
2008
13 years 6 months ago
2008
We consider a variation of a problem stated by Erd
CCCG
2008
13 years 6 months ago
2008
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
CCCG
2008
13 years 6 months ago
2008
We investigate the problem of finding orthogonal polygons that fold to plural incongruent orthogonal boxes. There are two known polygons that fold to produce two incongruent ortho...
CCCG
2008
13 years 6 months ago
2008
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We ext...