Fast algorithms for computing the diameter of a finite planar set
type: Item
instance of: scholarly article
title: Fast algorithms for computing the diameter of a finite planar set
zbMATH Open document ID: 0646.68050
DOI: 10.1007/BF01901195
author: Binay Bhattacharya
author: Godfried Toussaint
published in: The Visual Computer
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 4055036
zbMATH Keywords: Monte Carlo simulation
zbMATH Keywords: diameter
zbMATH Keywords: finite planar set
zbMATH Keywords: worst-case running time
zbMATH Keywords: expected-complexity
zbMATH Keywords: approximate algorithm
MaRDI profile type: Publication
cites work: A fast convex hull algorithm
cites work: On the multimodality of distances in convex polygons
cites work: On the Average Number of Maxima in a Set of Vectors and Applications
cites work: Divide and conquer for linear expected time
cites work: A Counterexample to a Diameter Algorithm for Convex Polygons
cites work: Q3716329
cites work: A note on finding convex hulls via maximal vectors
cites work: Q4403756
cites work: On Finding the Maxima of a Set of Vectors
full work available at URL: https://doi.org/10.1007/bf01901195
OpenAlex ID: W4238476868
description: scientific article; zbMATH DE number 4055036