EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057)
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: EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS |
scientific article; zbMATH DE number 5012008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS |
scientific article; zbMATH DE number 5012008 |
Statements
EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (English)
0 references
13 March 2006
0 references
optimal bridge between polygons
0 references
polynomial time approximation scheme
0 references
exact algorithm
0 references
0 references
0.90316135
0 references
0.88615984
0 references
0.8810904
0 references
0.86496174
0 references
0.85010517
0 references
0.81603146
0 references
0.8107452
0 references
