Fast algorithms for computing the diameter of a finite planar set

DOI10.1007/BF01901195zbMath0646.68050OpenAlexW4238476868MaRDI QIDQ1104078

Godfried T. Toussaint, Binay K. Bhattacharya

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

diameterMonte Carlo simulationapproximate 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)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on finding convex hulls via maximal vectors
• On the multimodality of distances in convex polygons
• A fast convex hull algorithm
• Divide and conquer for linear expected time
• A Counterexample to a Diameter Algorithm for Convex Polygons
• On Finding the Maxima of a Set of Vectors
• On the Average Number of Maxima in a Set of Vectors and Applications

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