Sciweavers

COMGEO
2000
ACM
13 years 11 months ago
Computing simple paths among obstacles
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
COMGEO
2000
ACM
13 years 11 months ago
Chromatic nearest neighbor searching: A query sensitive approach
David M. Mount, Nathan S. Netanyahu, Ruth Silverma...
COMGEO
2000
ACM
13 years 11 months ago
A hierarchical method for real-time distance computation among moving convex bodies
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
Leonidas J. Guibas, David Hsu, Li Zhang
COMGEO
2000
ACM
13 years 11 months ago
Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
Arthur D. Gregory, Ming C. Lin, Stefan Gottschalk,...
COMGEO
2000
ACM
13 years 11 months ago
Approximation algorithms for lawn mowing and milling
Esther M. Arkin, Sándor P. Fekete, Joseph S...