Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
From MaRDI portal
Publication:2482899
DOI10.1016/S0925-7721(96)00010-7zbMath1133.68464OpenAlexW1982722044MaRDI QIDQ2482899
Publication date: 25 April 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(96)00010-7
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
COMPUTING THE DIAMETER OF A POINT SET ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ An efficient algorithm for the three-dimensional diameter problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diameter, width, closest line pair, and parametric searching
- Fast detection of polyhedral intersection
- Applications of random sampling in computational geometry. II
- A new linear algorithm for intersecting convex polygons
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Parallelism in Comparison Problems
- Slowing down sorting networks to obtain faster sorting algorithms
- A deterministic algorithm for the three-dimensional diameter problem
This page was built for publication: Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).