Length minimizing paths in the hyperbolic plane: proof via paired subcalibrations (Q938616): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:45, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Length minimizing paths in the hyperbolic plane: proof via paired subcalibrations |
scientific article |
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
