Computing a minimum weight triangulation of a sparse point set (Q1304398)
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 1339775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a minimum weight triangulation of a sparse point set |
scientific article; zbMATH DE number 1339775 |
Statements
Computing a minimum weight triangulation of a sparse point set (English)
0 references
30 January 2001
0 references
computational geometry
0 references
minimum weight triangulation
0 references
sufficient condition for finding subgraphs
0 references
0.8307291865348816
0 references
0.8147813677787781
0 references
0.8135465979576111
0 references
0.8112478852272034
0 references
