Steiner minimal trees on regular polygons with centre (Q1894775)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Steiner minimal trees on regular polygons with centre |
scientific article; zbMATH DE number 778540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steiner minimal trees on regular polygons with centre |
scientific article; zbMATH DE number 778540 |
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
0.95387465
0 references
0.91822183
0 references
0 references
0.9054673
0 references
0.89034784
0 references
0 references
