Counting Large Distances in Convex Polygons: A Computational Approach

DOI10.1007/978-1-4614-0110-0_22zbMath1272.05040OpenAlexW2075318677MaRDI QIDQ2847919

No author found.

Publication date: 25 September 2013

Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_22

zbMATH Keywords

large distancesdisjoint convex hull intervalsdistance configurations

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Distance in graphs (05C12)

Related Items (1)

Large simplices determined by finite point sets

This page was built for publication: Counting Large Distances in Convex Polygons: A Computational Approach