| Article Details | ||
|---|---|---|
| Title: | An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Pankaj K. Agarwal |
|
| Kyle Fox |
|
|
| Oren Salzman |
|
|
| Sharing: | Unknown | |
| Verification: | Authors have not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | 0940671, 1012254, 1161359, 1408846, 1513816 | |
| DBLP Key: | conf/soda/AgarwalFS16 | |
| Author Comments: | ||