The test results show that this algorithm makes better improvement in time complexity than the horizontal union algorithms of common universe concept lattice found in related literature.
提出了同类概念的观点，在格的合并算法中通过利用同域概念格之间的同类概念和概念的父—子关系实现对其所有子节点的快速更新，以提高概念格横向合并算法的时间效率。
Using the inherent general-special relation between concepts in sublattice, the horizontal union algorithm of multiple concept lattices to construct the concept lattice is also presented.
最后结合子概念格中概念间固有的泛化-特化关系，提出一种多概念格的横向合并算法来构造概念格。
This algorithm can be used to calculate not only intersection but also set-theoretic differences and union of two polygons .
该算法不仅可以求多边形的“交”，而且可以求多边形的“并”和“差”。
应用推荐