Querying Two Boundary Points for Shortest Paths in a Polygonal Domain (Q3652291): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_106 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1719465442 / rank | |||
Normal rank | |||
Latest revision as of 23:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Querying Two Boundary Points for Shortest Paths in a Polygonal Domain |
scientific article |
Statements
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain (English)
0 references
17 December 2009
0 references
