Diameter, Width, Closest Line Pair, and Parametric Searching

Abstract

We apply Megiddo's parametric searching technique to several geometric optimization problems and derive significantly improve solutions for them. We obtain, for any fixed &#949; &gt; 0, an <italic>O</italic>(<italic>n</italic><supscrpt>1+&#949;</supscrpt>) algorithm for computing the diameter of a point set in 3-space, an <italic>O</italic>(<italic>n… (More)
DOI: 10.1145/142675.142702

Topics

Cite this paper

@inproceedings{Chazelle1992DiameterWC, title={Diameter, Width, Closest Line Pair, and Parametric Searching}, author={Bernard Chazelle and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir}, booktitle={Symposium on Computational Geometry}, year={1992} }