(1)載入x-y plan座標點, 至quadtree結構
(2)找出走過所有座標點的最短路徑
我自己查詢相關資訊, 都找不太到相關演算法,
不過我自己發現, quadtree建構出來後, 好像只要traversal, 就會是最短走法.
請問有相關參考資料? 我猜測正確?
網上的論文, 都是影像處理, 講的都很深......
class QT_Node {
long x;
long y;
*NE //North East
*SE //South East
*SW //North West
*NW //North West
}
traversal 優先權 : NW > SW > root > SE > SW
這種多元樹的走訪方式, 應該怎麼稱呼,
如果懂我在講什麼的, 請幫我解答, 感謝.
This entry passed through the Full-Text RSS service — if this is your content and you're reading it on someone else's site, please read the FAQ at fivefilters.org/content-only/faq.php#publishers. Five Filters recommends: 'You Say What You Like, Because They Like What You Say' - http://www.medialens.org/index.php/alerts/alert-archive/alerts-2013/731-you-say-what-you-like-because-they-like-what-you-say.html