Intersection of unit-balls and diameter of a point set in R3
- 31 July 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 8 (2) , 57-65
- https://doi.org/10.1016/s0925-7721(96)00010-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Diameter, width, closest line pair, and parametric searchingDiscrete & Computational Geometry, 1993
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- A new linear algorithm for intersecting convex polygonsComputer Graphics and Image Processing, 1982
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- Beweis einer Vermutung von A. VázsonyiActa Mathematica Hungarica, 1956