Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles
The paper presents a new algorithm to determine the shortest, non-crossing, rectilinear paths in a twodimensional grid graph. The shortest paths are determined in a manner ensuring that they do not cross each other and bypass any obstacles present. Such shortest paths are applied in robotic chip de...
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
National Institute of Telecommunications
2018-09-01
|
| Σειρά: | Journal of Telecommunications and Information Technology |
| Θέματα: | |
| Διαθέσιμο Online: | https://jtit.pl/jtit/article/view/626 |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|