A simple algorithm for enumerating longest distances in the plane

DOI10.1016/0020-0190(93)90215-UzbMath0771.68101OpenAlexW1983298990MaRDI QIDQ2366076

Jason Shugart, Matthew T. Dickerson

Publication date: 29 June 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90215-u

zbMATH Keywords

\(L_ p\) distance metricslongest distances

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Geometric Applications of Posets ⋮ ON ENUMERATING AND SELECTING DISTANCES ⋮ Geometric applications of posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• L-infinity interdistance selection by parametric search
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS

This page was built for publication: A simple algorithm for enumerating longest distances in the plane