tripplanningqueries(編輯修改稿)
2025-08-13 17:46 本頁(yè)面
【文章內(nèi)容簡(jiǎn)介】 total number of categories. The Minimum Distance Algorithm S D p 1 p 2 p 3 candidate p search region SR ?The Minimum Distance Algorithm restricts the search space/region as an ellipse. Other Algorithms ? Previous algorithms give approximations in terms of m. ? Approximations in terms of the maximum category cardinality r: ?Use Integer Linear Programming. ? Approximations in terms of both m and r: ?Use the generalized minimum spanning tree. The Algorithms in Practice ? Can we use the previous algorithms in practice for spatial databases? ?Applications in Euclidean spaces using Rtrees. ?Applications in Road works using specialized indices NN Algorithm on Rtrees ? Starting from S locate the nearest neighbor of S that belongs to any category in R. ? Iteratively continue until all categories have been covered. ? Co
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1