Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
Journal of Algorithms
Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the general motion planning problem with two degrees of freedom
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Efficient motion planning for an L-shaped object
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Placing the largest similar copy of a convex polygon among polygonal obstacles
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Compliant motion in a simple polygon
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The complexity and construction of many faces in arrangements of lines and of segments
Discrete & Computational Geometry - Special issue on the complexity of arrangements
A survey of motion planning and related geometric algorithms
Geometric reasoning
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Stabbing and ray shooting in 3 dimensional space
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Efficient ray shooting and hidden surface removal
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Extremal polygon containment problems
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Finding stabbing lines in 3-dimensional space
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On lines missing polyhedral sets in 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
| Hi-index | 0.00 |
In the first part of the paper we solve the problem of detecting efficiently if a query simplex is collison-free among polyhedral obstacles. In order to solve this problem we develop new on-line data structures to detect intersections of query halfplanes with sets of lines and segments.In the second part we consider the nearest-neighbor problems. Given a set of n lines in 3-space, the shortest vertical segment between any pair of lines is found in randomized expected time O(n8/5+&egr;) for every &egr; 0. The longest connecting vertical segment is found in time O(n4/3+&egr;). The shortest connecting segment is found in time O(n5/3+&egr;).