Sciweavers

CCCG
1996
13 years 5 months ago
O-Convexity Computing Hulls Approximations and Orientation Sets
V. Martynchik, Nikolai N. Metelski, Derick Wood
CCCG
1996
13 years 5 months 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
1994
13 years 5 months ago
Widest Empty Corridor with Multiple Links and Right-angle Turns
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
Siu-Wing Cheng
CCCG
1996
13 years 5 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
1994
13 years 5 months ago
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points
Olivier Devillers, Mordecai J. Golin, Klara Kedem,...
CCCG
1994
13 years 5 months ago
Optimal Slope Selection Via Cuttings
Hervé Brönnimann, Bernard Chazelle
CCCG
1994
13 years 5 months ago
K-Guarding Polygons on the Plane
Patrice Belleville, Prosenjit Bose, Jurek Czyzowic...
CCCG
1996
13 years 5 months ago
Computing Largest Circles Separating Two Sets of Segments
Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier D...
CCCG
1996
13 years 5 months 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...