Sciweavers

233 search results - page 30 / 47
» cccg 2007
Sort
View
CCCG
1993
13 years 8 months ago
Shortest Paths for a Two-robot Rendez-vous
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...
Erik L. Wynters, Joseph S. B. Mitchell
CCCG
1996
13 years 8 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
CCCG
1996
13 years 8 months ago
Fast Stabbing of Boxes in High Dimensions
We present in this paper a simple yet e cient algorithm for stabbing a set S of n axisparallel boxes in d-dimensional space with c(S) points in output-sensitive time O(dn log c(S)...
Frank Nielsen
CCCG
2009
13 years 8 months ago
Symmetry Restoration by Stretching
We consider restoring the bilateral symmetry of an object which has been deformed by compression. This problem arises in paleontology, where symmetric bones are compressed in the ...
Michael M. Kazhdan, Nina Amenta, Shengyin Gu, Davi...
CCCG
2009
13 years 8 months ago
On Graph Thickness, Geometric Thickness, and Separator Theorems
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
Christian A. Duncan