31 search results - page 2 / 7 » cccg 2003 |
55
Voted
CCCG
2003
14 years 12 months ago
2003
CCCG
2003
14 years 12 months ago
2003
We explore an instance of the question of partitioning a polygon into pieces, each of which is as “circular” as possible, in the sense of having an aspect ratio close to
CCCG
2003
14 years 12 months ago
2003
A convex polyhedron P is equiprojective if, for some k, the orthogonal projection (or “shadow”) of P in every direction, except those directions parallel to faces of P, is a k...
CCCG
2003
14 years 12 months ago
2003
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
CCCG
2003
14 years 12 months ago
2003
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...