Sciweavers

CCCG
1996
14 years 23 days ago
Time-optimal Proximity Graph Computations on Enhanced Meshes
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
CCCG
1996
14 years 23 days 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
1996
14 years 23 days ago
On Stable Line Segments in Triangulations
Andranik Mirzaian, Cao An Wang, Yin-Feng Xu
CCCG
1996
14 years 23 days ago
O-Convexity Computing Hulls Approximations and Orientation Sets
V. Martynchik, Nikolai N. Metelski, Derick Wood
CCCG
1996
14 years 23 days ago
Generalizing Halfspaces
Restricted-orientation convexity is the study of geometric objects whose intersection with lines from some fixed set is empty or connected. We have studied the properties of restri...
Eugene Fink, Derick Wood
CCCG
1996
14 years 23 days 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
14 years 23 days ago
Computing Largest Circles Separating Two Sets of Segments
Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier D...
CCCG
1996
14 years 23 days ago
Computing the Angularity Tolerance
In computational metrology one needs to compute whether an object satis es speci cations of shape within an acceptable tolerance. To this end positions on the object are measured,...
Mark de Berg, Henk Meijer, Mark H. Overmars, Gordo...