Computing the minimum weight triangulation of a set of linearly ordered points (Q1198019): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on Delaunay and optimal triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal Triangulations of Polygonal Domains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The greedy and Delaunay triangulations are not bad in the average case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
Revision as of 15:35, 16 May 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
