233 search results - page 26 / 47 » cccg 2007 |
CCCG
2007
13 years 8 months ago
2007
A quadtree-based triangulation, sometimes called an RTIN, is a common hierarchical representation of terrain for 3D visualization. In this paper we focus on the memory/error bound...
CCCG
2007
13 years 8 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
CCCG
2007
13 years 8 months ago
2007
We analyze the computational complexity of various rolling cube puzzles.
CCCG
2007
13 years 8 months ago
2007
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid ...
CCCG
2006
13 years 8 months ago
2006
Suppose intruders are in a dark polygonal room and they can move at a finite but unbounded speed, trying to avoid detection. A boundary 1-searcher can move along the polygon bounda...