Querying two boundary points for shortest paths in a polygonal domain (extended abstract) (Q3652291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5649457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Querying two boundary points for shortest paths in a polygonal domain (extended abstract) |
scientific article; zbMATH DE number 5649457 |
Statements
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain (English)
0 references
17 December 2009
0 references
0.9962937235832214
0 references
0.9138930439949036
0 references
0.8337120413780212
0 references
0.8304204344749451
0 references
