scientific article; zbMATH DE number 1303550

zbMATH Open0936.68098MaRDI QIDQ4250174FDOQ4250174

Authors: Sergei Bespamyatnikh 

Publication date: 25 May 2000

Title of this publication is not available (Why is that?)

Recommendations

• An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
• An efficient algorithm for the three-dimensional diameter problem
• A tight lower bound for computing the diameter of a 3D convex polytope
• Lower Bounds for Geometric Diameter Problems

zbMATH Keywords

three-dimensional diameter problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (12)

• Lower Bounds for Geometric Diameter Problems
• Fast algorithms for computing the diameter of a finite planar set
• On finding a large number of 3D points with a small diameter
• Title not available (Why is that?)
• On computing the diameter of a point set in high dimensional Euclidean space.
• A tight lower bound for computing the diameter of a 3D convex polytope
• An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
• A memetic algorithm to schedule planned maintenance for the national grid
• Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
• Quantum speed-up for unsupervised learning
• An efficient algorithm for the three-dimensional diameter problem
• Diameter, width, closest line pair, and parametric searching

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250174)