A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes (Q6499550)
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: A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes |
scientific article; zbMATH DE number 7844904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes |
scientific article; zbMATH DE number 7844904 |
Statements
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes (English)
0 references
8 May 2024
0 references
approximate shortest path
0 references
triangular tessellation
0 references
weighted region problem
0 references
0 references
0 references
0 references
0 references
0 references
