Length minimizing paths in the hyperbolic plane: proof via paired subcalibrations (Q938616)
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: Length minimizing paths in the hyperbolic plane: proof via paired subcalibrations |
scientific article; zbMATH DE number 5316788
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Length minimizing paths in the hyperbolic plane: proof via paired subcalibrations |
scientific article; zbMATH DE number 5316788 |
Statements
Length minimizing paths in the hyperbolic plane: proof via paired subcalibrations (English)
0 references
26 August 2008
0 references
The metric Steiner tree problem (finding the shortest path connecting several points in the plane) is solved for a regular \(n\)-gon in the hyperbolic plane for \(n\in \{3,4\}\) by computational means involving vector fields.
0 references
paired subcalibrations
0 references
hyperbolic plane
0 references
metric Steiner tree problem
0 references
0.8803376
0 references
0 references
0.8688021
0 references
0.86532307
0 references
0.85992455
0 references
0.8577917
0 references
0.85727465
0 references
0.8566531
0 references
