Fast algorithms for computing the diameter of a finite planar set

DOI10.1007/BF01901195MaRDI QIDQ1104078zbMATH OpenOpenAlexFDO

Authors Binay Bhattacharya, Godfried Toussaint

Publication date 1988

Published in The Visual Computer (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01901195

zbMATH Keywords

Monte Carlo simulationdiameterapproximate algorithmexpected-complexityfinite planar setworst-case running time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 4041267
• 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

Cites work

• scientific article; zbMATH DE number 3945378 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• A Counterexample to a Diameter Algorithm for Convex Polygons
• A fast convex hull algorithm
• A note on finding convex hulls via maximal vectors
• Divide and conquer for linear expected time
• On Finding the Maxima of a Set of Vectors
• On the Average Number of Maxima in a Set of Vectors and Applications
• On the multimodality of distances in convex polygons

Cited in

(7)

• COMPUTING THE DIAMETER OF A POINT SET
• scientific article; zbMATH DE number 2087464 (Why is no real title available?)
• scientific article; zbMATH DE number 4041267 (Why is no real title available?)
• A fast algorithm for finding the compact sets
• Algorithms - ESA 2003
• Fast Algorithms for Pseudoarboricity
• An efficient algorithm for the three-dimensional diameter problem

This page was built for publication: Fast algorithms for computing the diameter of a finite planar set

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