Sciweavers

66 search results - page 7 / 14
» cccg 2010
Sort
View
53
Voted
CCCG
2010
14 years 11 months ago
On a dispersion problem in grid labeling
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...
Minghui Jiang, Vincent Pilaud, Pedro J. Tejada
CCCG
2010
14 years 11 months ago
Maximum geodesic routing in the plane with obstacles
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...
David L. Millman, Matthew O'Meara, Jack Snoeyink, ...
CCCG
2010
14 years 11 months ago
Small strong epsilon nets
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...
Pradeesha Ashok, Sathish Govindarajan, Janardhan K...
CCCG
2010
14 years 11 months ago
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs
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...
Stefan Huber, Martin Held
CCCG
2010
14 years 11 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
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...
Craig Dillabaugh