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...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Carleton University
2017-03-01
|
| Schriftenreihe: | Journal of Computational Geometry |
| Online-Zugang: | https://jocg.org/index.php/jocg/article/view/3045 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|