Convex polygons with few intervertex distances
From MaRDI portal
Publication:1900991
DOI10.1016/0925-7721(94)00020-VzbMATH Open0831.68112OpenAlexW1975030162MaRDI QIDQ1900991FDOQ1900991
Authors: Peter 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
Recommendations
Cites Work
Cited In (11)
- Convex nonagons with five intervertex distances
- Intervertex distances in convex polygons
- Polygonal distances theorems for two regular polygons
- Computational geometric aspects of rhythm, melody, and voice-leading
- Classification of seven-point four-distance sets in the plane
- Uniqueness of maximum planar five-distance sets
- Unit distances between vertices of a convex polygon
- About convex 4-isosceles 7-point sets
- Title not available (Why is that?)
- Distance Sets on Circles
- Maximum planar sets that determine \(k\) distances
This page was built for publication: Convex polygons with few intervertex distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900991)