Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842)
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 7445259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest rectilinear path queries to rectangles in a rectangular domain |
scientific article; zbMATH DE number 7445259 |
Statements
Shortest rectilinear path queries to rectangles in a rectangular domain (English)
0 references
15 December 2021
0 references
shortest path
0 references
rectilinear path
0 references
rectangular domain
0 references
geodesic distance
0 references
nearest and farthest neighbors
0 references
0 references
0.8483323454856873
0 references
0.8315664529800415
0 references
0.823271632194519
0 references
0.8152394890785217
0 references
