Efficient algorithms for computing the maximum distance between two finite planar sets

DOI10.1016/0196-6774(83)90040-8zbMath0509.68065OpenAlexW2074815218MaRDI QIDQ4747526

Binay K. Bhattacharya, Godfried T. Toussaint

Publication date: 1983

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(83)90040-8

zbMATH Keywords

finite planar setsmaximum euclidean distance

Mathematics Subject Classification ID

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

Related Items (2)

\(\alpha\)-kernel problem with fuzzy visibility ⋮ On the longest spanning tree with neighborhoods

This page was built for publication: Efficient algorithms for computing the maximum distance between two finite planar sets