摘要
探讨三种基于位图的靠接算法,对其计算模型进行时间复杂度分析,并在排样系统应用中进行了测试比较。结果证明,判距 靠接法是综合时间算法的最优方法。
In this paper, a comparison of three collision algorithms based on bitmap is presented with the runtime complexities of the algorithms discussed. The results of application show that the algorithm of collision by judgment of distance is the best one.
基金
国家自然科学基金资助项目(6993403)
广州市科技攻关资助项目(2002Z3-D3111).
