Convex polygons with few intervertex distances

DOI10.1016/0925-7721(94)00020-VzbMath0831.68112OpenAlexW1975030162MaRDI QIDQ1900991

Peter C. Fishburn

Publication date: 29 October 1995

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(94)00020-v

zbMATH Keywords

intervertex distances

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Intervertex distances in convex polygons ⋮ Classification of seven-point four-distance sets in the plane ⋮ Distance Sets on Circles ⋮ Maximum planar sets that determine \(k\) distances ⋮ Uniqueness of maximum planar five-distance sets ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ About convex 4-isosceles 7-point sets

Cites Work

• A postscript on distances in convex \(n\)-gons
• Multiplicities of interpoint distances in finite planar sets
• On A Problem of P. Erdos
• Some Theorems on Convex Polygons
• On Sets of Distances of n Points

This page was built for publication: Convex polygons with few intervertex distances