A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
Year
: 2011DOI: 10.1007/978-3-642-23719-5_41
Collections
:
-
Statistics
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
Show full item record
| contributor author | Danny Z. Chen | |
| contributor author | Haitao Wang | |
| date accessioned | 2020-03-14T10:31:20Z | |
| date available | 2020-03-14T10:31:20Z | |
| date issued | 2011 | |
| identifier other | uZUWZvMxtHRZ1Ng4lik6olpLah7YUXPsyBuGEbXskCfFhWN7JE.pdf | |
| identifier uri | https://libsearch.um.ac.ir:443/fum/handle/fum/1619839?locale-attribute=en | |
| format | general | |
| language | English | |
| title | A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane | |
| type | Journal Paper | |
| contenttype | Fulltext | |
| contenttype | Fulltext | |
| identifier padid | 11704636 | |
| identifier doi | 10.1007/978-3-642-23719-5_41 | |
| journal title | Lecture Notes in Computer Science | |
| coverage | Academic | |
| pages | 481-492 | |
| filesize | 12453340 | |
| citations | 1 |