CCCG
2003
13 years 6 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...
CCCG
2003
13 years 6 months ago
2003
CCCG
2003
13 years 6 months ago
2003
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
CCCG
2003
13 years 6 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
13 years 6 months ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
CCCG
2003
13 years 6 months ago
2003
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
CCCG
2003
13 years 6 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
CCCG
2003
13 years 6 months ago
2003
We address a question posed by Sibley and Wagon. They proved that rhombic Penrose tilings in the plane can be 3colored, but a key lemma of their proof fails in the natural 3D gene...
CCCG
2003
13 years 6 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
13 years 6 months ago
2003
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...