A deterministic algorithm for the three-dimensional diameter problem
- 31 July 1996
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 6 (4) , 253-262
- https://doi.org/10.1016/0925-7721(95)00025-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximations and Optimal Geometric Divide-and-ConquerJournal of Computer and System Sciences, 1995
- On ray shooting in convex polytopesDiscrete & Computational Geometry, 1993
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- Efficient partition treesDiscrete & Computational Geometry, 1992
- Cutting hyperplane arrangementsDiscrete & Computational Geometry, 1991
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983