Intersection of unit-balls and diameter of a point set in R^3.
From MaRDI portal
Publication:2482899
DOI10.1016/S0925-7721(96)00010-7zbMATH Open1133.68464OpenAlexW1982722044MaRDI QIDQ2482899FDOQ2482899
Authors: Edgar A. Ramos 
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
Recommendations
- scientific article; zbMATH DE number 1303550
- COMPUTING THE DIAMETER OF A POINT SET
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
- A tight lower bound for computing the diameter of a 3D convex polytope
- Geometric algorithms for finding a point in the intersection of balls
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Title not available (Why is that?)
- Applications of random sampling in computational geometry. II
- Title not available (Why is that?)
- Parallelism in Comparison Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- A new linear algorithm for intersecting convex polygons
- Slowing down sorting networks to obtain faster sorting algorithms
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Title not available (Why is that?)
- Fast detection of polyhedral intersection
- Diameter, width, closest line pair, and parametric searching
- A deterministic algorithm for the three-dimensional diameter problem
Cited In (5)
This page was built for publication: Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482899)
