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 |
| Предмети: | |
| Онлайн доступ: | https://jtit.pl/jtit/article/view/626 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|