A simple algorithm for enumerating longest distances in the plane

DOI10.1016/0020-0190(93)90215-UzbMATH Open0771.68101OpenAlexW1983298990MaRDI QIDQ2366076FDOQ2366076

Authors: Matthew T. Dickerson, Jason Shugart 

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

Recommendations

• Selecting distances in the plane
• ON ENUMERATING AND SELECTING DISTANCES
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE

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)

Cites Work

• Title not available (Why is that?)
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Title not available (Why is that?)
• L-infinity interdistance selection by parametric search
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
• Title not available (Why is that?)
• Title not available (Why is that?)
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS

Cited In (4)

• Computing the all-pairs longest chains in the plane
• Geometric applications of posets
• Geometric applications of posets
• ON ENUMERATING AND SELECTING DISTANCES

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

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