The shortest distance among points in general position.

DOI10.1016/0925-7721(95)00055-0MaRDI QIDQ2482883zbMATH OpenOpenAlexFDO

Authors Géza Tóth

Publication date 25 April 2008

Published in Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/0925-7721(95)00055-0

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• On the number of occurrences of the \(k\)th smallest distance between points in convex position
• The multiplicity of the two smallest distances among points
• scientific article; zbMATH DE number 4151258
• scientific article; zbMATH DE number 3893887
• scientific article; zbMATH DE number 998049

Cites work

• scientific article; zbMATH DE number 4015581 (Why is no real title available?)
• scientific article; zbMATH DE number 108289 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• On the distribution of distances in finite sets in the plane
• The maximum number of second smallest distances in finite planar sets

Cited in

(3)

• The multiplicity of the two smallest distances among points
• General penny graphs are at most \(\frac{43}{18}\)-dense
• Small distances in convex polygons

This page was built for publication: The shortest distance among points in general position.

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