A simple algorithm for enumerating longest distances in the plane

DOI10.1016/0020-0190(93)90215-UMaRDI QIDQ2366076zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 432799 (Why is no real title available?)
• scientific article; zbMATH DE number 3160756 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 177543 (Why is no real title available?)
• L-infinity interdistance selection by parametric search
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION

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)