The Number of Furthest Neighbour Pairs of a Finite Planar Set

DOI10.2307/2322992MaRDI QIDQ3689008zbMATH OpenOpenAlexFDO

Authors David Avis

Publication date 1984

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2322992

zbMATH Keywords

symmetric furthest neighbour

Mathematics Subject Classification ID

Euclidean geometries (general) and generalizations (51M05) Metric geometry (51F99)

Recommendations

• On the Number of Furthest Neighbour Pairs in a Point Set
• Furthest neighbours in space
• Nearly Equal Distances in the Plane
• On large distances in planar sets
• The two largest distances in finite planar sets

Cited in

(10)

• The exact fitting problem in higher dimensions
• On the distribution of distances in finite sets in the plane
• On the Number of Furthest Neighbour Pairs in a Point Set
• Furthest neighbours in space
• Eccentric graphs
• Favourite distances in \(3\)-space
• Repeated distances in space
• The symmetric all-furthest-neighbor problem
• Determination of all graphs whose eccentric graphs are clusters
• Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs

This page was built for publication: The Number of Furthest Neighbour Pairs of a Finite Planar Set

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