Computing the minimum weight triangulation of a set of linearly ordered points (Q1198019)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 92089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the minimum weight triangulation of a set of linearly ordered points |
scientific article; zbMATH DE number 92089 |
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
