A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799)
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: A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets |
scientific article; zbMATH DE number 37172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets |
scientific article; zbMATH DE number 37172 |
Statements
A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (English)
0 references
28 June 1992
0 references
rectilinear metric
0 references
rectangular convex hull
0 references
Steiner minimal tree
0 references
0 references
