k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218195999000315 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104671918 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 2024
scientific article; zbMATH DE number 2174847
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON |
scientific article; zbMATH DE number 2174847 |
Statements
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (English)
0 references
10 June 2005
0 references
Non-crossing paths
0 references
simple polygon
0 references
polygon decomposition
0 references
geodesic triangulation
0 references
axis-parallel paths
0 references
0 references
