Computing the minimum weight triangulation of a set of linearly ordered points (Q1198019): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:48, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the minimum weight triangulation of a set of linearly ordered points |
scientific article |
Statements
Computing the minimum weight triangulation of a set of linearly ordered points (English)
0 references
16 January 1993
0 references
We describe an \(O(n^ k)\) time and space algorithm to obtain a minimum weight triangulation of a set of linearly ordered points.
0 references
triangulation
0 references
