Algorithms for Generating Convex Polyhedrons Over Three Dimensional Rectangular Grid

This paper discusses various algorithms related to generation of 3-D convex polyhedrons. These convexpolyhedrons can be used as structuring elements in the mathematical morphological processing of 3-Ddigital images. The first algorithm proposes a new way of automatic construction of 256 convexpolyhedrons in a 3-D rectangular grid by removing the duplicate subsets. The second algorithm proposes away for hierarchy construction in visualizing the relationships between sets and their correspondingsubsets of all 256 convex polyhedrons. The third algorithm proposes a way of visualizing all 256 convexpolyhedrons depending on user selection.