Abstract：Macro-to-Micro Model is similar to the idea of Granular Computing. The Macro-to-Micro data structure can be built in O(n) time. It can also be built in O(1) time by parallel technology. Moreover, dynamic insertion, deletion and query operation can be completed in constant time without the problem of breaking the balance of tree. This data structure and preprocessing operation can be shared with Macro-to-Micro algorithms, so that we can greatly improve the efficiency of the multi-operation problem. Experimental results show that the nearest neighbour searching and convex hull algorithm based on Macro-to-Micro model has great advantage than traditional algorithm.
2010, Vol. 1 