On the complexity of minimum-link path problems
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are restricted to lie on the boundary of the domain, or can be in its i...
-д хадгалсан:
| Үндсэн зохиолчид: | , , , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Carleton University
2017-03-01
|
| Цуврал: | Journal of Computational Geometry |
| Онлайн хандалт: | https://jocg.org/index.php/jocg/article/view/3045 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|