66 search results - page 7 / 14 » cccg 2010 |
CCCG
2010
15 years 1 months ago
2010
Given k labelings of a finite d-dimensional grid, define the combined distance between two labels to be the sum of the 1-distance between the two labels in each labeling. We prese...
CCCG
2010
15 years 1 months ago
2010
Do convex obstacles in the plane always leave 3 separate escape routes? Here, an escape route is a locally geodesic path that avoids the obstacles; escape routes are separate if t...
CCCG
2010
15 years 1 months ago
2010
In this paper, we initiate the study of small strong nets and prove bounds for axis-parallel rectangles, half spaces, strips and wedges. We also give some improved bounds for smal...
87
Voted
CCCG
2010
15 years 1 months ago
2010
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
101
click to vote
CCCG
2010
15 years 1 months ago
2010
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...