ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158)
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: ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE |
scientific article |
Statements
ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (English)
0 references
24 November 2014
0 references
shortest path
0 references
convex hull
0 references
planar complex
0 references
geodesic
0 references
\(l_{2}\)-distance
0 references
global non-positive curvature
0 references
0 references
0 references
0.87896687
0 references
0.87575394
0 references
0.8698227
0 references
0.8681404
0 references
0.86764455
0 references
0.8674313
0 references
