Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Linear programming in low dimensions
Handbook of discrete and computational geometry
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
On optimal bridges between two convex regions
Information Processing Letters
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A subexponential algorithm for abstract optimization problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Finding an Optimal Bridge between Two Polygons
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
We give efficient algorithms for constructing a bridge between two convex regions in a fixed dimensional space so that the diameter of the bridged region is minimized. If both the set of vertices and the set of halfspaces defining the facets of the convex regions are given, we have an optimal linear time randomized algorithm. In only vertices are given, we give a subquadratic time algorithm, and if only halfspaces are given, we give a quadratic time algorithm.