31 search results - page 6 / 7 » cccg 2003 |
CCCG
2003
13 years 8 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 8 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
CCCG
2003
13 years 8 months ago
2003
We prove that for any two simple chains [more generally, trees] in Rd with corresponding edges parallel, there is a parallel morph between them—i.e. a morph in which all interme...
CCCG
2003
13 years 8 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...
CCCG
2003
13 years 8 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...