Exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle

DOI10.7153/mia-2020-23-54zbMath1444.26011arXiv1904.11427OpenAlexW3019792021MaRDI QIDQ3300408

Iosif Pinelis

Publication date: 28 July 2020

Published in: Mathematical Inequalities & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.11427

zbMATH Keywords

convexitynon-convex optimizationmetric geometryexact boundsgeometric inequalitiesnearest-neighbour distances

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Other analytical inequalities (26D20)

Cites Work

• Unnamed Item
• Efficient multivariate entropy estimation via \(k\)-nearest neighbour distances
• Exploring the tiers of rooted phylogenetic network space using tail moves
• Demystifying Fixed <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math> </inline-formula>-Nearest Neighbor Information Estimators
• Algorithms in real algebraic geometry

This page was built for publication: Exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle