Intersection of unit-balls and diameter of a point set in R^3.

DOI10.1016/S0925-7721(96)00010-7MaRDI QIDQ2482899zbMATHOpenAlexFDO

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

zbMATH Keywords

geometric algorithmsparametric searchintersection of ballsdiameter of a point set

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

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

Cites work

• scientific article; zbMATH DE number 3122839 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• A deterministic algorithm for the three-dimensional diameter problem
• A new linear algorithm for intersecting convex polygons
• Applications of random sampling in computational geometry. II
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Diameter, width, closest line pair, and parametric searching
• Fast detection of polyhedral intersection
• Parallelism in Comparison Problems
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Slowing down sorting networks to obtain faster sorting algorithms

Cited in

(5)

• Line intersection searching amid unit balls in 3-space
• Towards sub-quadratic diameter computation in geometric intersection graphs
• Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
• An efficient algorithm for the three-dimensional diameter problem
• COMPUTING THE DIAMETER OF A POINT SET

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)