Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
- 1 May 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 290-299
- https://doi.org/10.1145/336154.336215
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- A deterministic algorithm for the three-dimensional diameter problemComputational Geometry, 1996
- Derandomization in Computational GeometryJournal of Algorithms, 1996
- Planar Separators and Parallel Polygon TriangulationJournal of Computer and System Sciences, 1995
- Approximations and Optimal Geometric Divide-and-ConquerJournal of Computer and System Sciences, 1995
- A geometric consistency theorem for a symbolic perturbation schemeJournal of Computer and System Sciences, 1990
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982
- Beweis einer Vermutung von A. VázsonyiActa Mathematica Hungarica, 1956