Algorithm for Constructing Complete Distributive Lattice of Polyhedrons Defined over Three Dimensional Rectangular Grid- Part II
Algorithm for Constructing Complete Distributive Lattice of Polyhedrons Defined over Three Dimensional Rectangular Grid- Part II
复制标题
三维矩形网格上定义的多面体完整分布格的构造算法-第二部分
DOI：
10.1007/978-3-642-27317-9_22
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
E. Rajan
中科院分区：
文献类型：
--
作者：
G. R. Chandra;E. Rajan
本文首先讨论了几何滤波器（G-滤波器）是如何作为一个有效的形状滤波器相比，其他形状滤波器，如数学形态学。本文将三维矩形网格多面体完全分配格的构造算法分为两种。第一个算法提出了一种新的方法，自动构造256凸多边形删除重复的子集。第二个算法提出了一种层次化的路径枚举方法，将凸多面体集与其子集之间的关系可视化。最后的网格是基于这两个算法提供的信息生成的。
This paper initially discusses how Geometric Filters (G-Filters) are useful as an efficient shape filter when compared to other shape filter such as mathematical morphology. The algorithm for constructing complete distributive lattice of polyhedrons for three dimensional rectangular grid is divided in to two algorithms. The first algorithm proposes a new way automatic construction of 256 convex polygons by removing the duplicate subsets. The second algorithm proposes a way for hierarchical path enumeration in visualizing the relationships between convex polyhedron sets and their corresponding subsets. The final lattice is generated based on the information provided by these two algorithms.