Efficient randomized algorithms for some geometric optimization problems
Open Access
- 1 April 1996
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 16 (4) , 317-337
- https://doi.org/10.1007/bf02712871
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- The overlay of lower envelopes in three dimensions and its applicationsPublished by Association for Computing Machinery (ACM) ,1995
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- Diameter, width, closest line pair, and parametric searchingDiscrete & Computational Geometry, 1993
- Computing the longest diagonal of a simple polygonInformation Processing Letters, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- An algorithm for generalized point location and its applicationsJournal of Symbolic Computation, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- A singly-exponential stratification scheme for real semi-algebraic varieties and its applicationsPublished by Springer Nature ,1989
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983