Algorithms for Generating Convex Polyhedrons Over Three Dimensional Rectangular Grid
G. Ramesh Chandra · Signal & Image Processing An International Journal · 2012
This paper discusses various algorithms related to generation of 3-D convex polyhedrons.These convex polyhedrons can be used as structuring elements in the mathematical morphological processing of 3-D digital images.The first algorithm proposes a new way of automatic construction of 256 convex polyhedrons in a 3-D rectangular grid by removing the duplicate subsets.The second algorithm proposes a way for hierarchy construction in visualizing the relationships between sets and their corresponding subsets of all 256 convex polyhedrons.The third algorithm proposes a way of visualizing all 256 convex polyhedrons depending on user selection.