Steiner minimal trees on regular polygons with centre (Q1894775): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:17, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Steiner minimal trees on regular polygons with centre |
scientific article |
Statements
Steiner minimal trees on regular polygons with centre (English)
0 references
24 July 1995
0 references
Given a finite set of points in Euclidean plane, the shortest network interconnecting all points in the set is called the Steiner minimum tree on the point set. In this paper, the authors determine the Steiner minimum tree on the point set consisting of the center and all vertices of a regular polygon.
0 references
Euclidean plane
0 references
Steiner minimum tree
0 references
point set
0 references
center
0 references
regular polygon
0 references
