scientific article; zbMATH DE number 4041267

zbMATH Open0638.68039MaRDI QIDQ3779744FDOQ3779744

Authors: Binay Bhattacharya, Godfried Toussaint 

Publication date: 1987

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

Recommendations

• Fast algorithms for computing the diameter of a finite planar set
• COMPUTING THE DIAMETER OF A POINT SET
• scientific article; zbMATH DE number 2087464
• A practical approach for computing the diameter of a point set
• scientific article; zbMATH DE number 1303550

zbMATH Keywords

computational geometryconvex hulldiametercomplexity analysisfinite planar setmaximal vectors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited In (8)

• Title not available (Why is that?)
• Fast algorithms for computing the diameter of a finite planar set
• A practical approach for computing the diameter of a point set
• On computing the diameter of a point set in high dimensional Euclidean space.
• A fast algorithm for finding the compact sets
• Algorithms - ESA 2003
• An efficient algorithm for the three-dimensional diameter problem
• COMPUTING THE DIAMETER OF A POINT SET

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 Q3779744)