scientific article; zbMATH DE number 4041267

MaRDI QIDQ3779744zbMATH OpenFDO

Authors Binay Bhattacharya, Godfried Toussaint

Publication date 1987

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)

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

Cited in

(8)

• COMPUTING THE DIAMETER OF A POINT SET
• scientific article; zbMATH DE number 2087464 (Why is no real title available?)
• 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

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)