Research Article
Algorithm for Constructing Complete Distributive Lattice of Polyhedrons Defined over Three Dimensional Rectangular Grid- Part II
283 downloads
@INPROCEEDINGS{10.1007/978-3-642-27317-9_22, author={G. Chandra and E. Rajan}, title={Algorithm for Constructing Complete Distributive Lattice of Polyhedrons Defined over Three Dimensional Rectangular Grid- Part II}, proceedings={Advances in Computer Science and Information Technology. Computer Science and Information Technology. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part III}, proceedings_a={CCSIT PART III}, year={2012}, month={11}, keywords={Geometric Filters Automatic Convex Polyhedron Construction lattice 3D rectangular grid Hierarchical Path Enumeration 3-D image processing}, doi={10.1007/978-3-642-27317-9_22} }- G. Chandra
E. Rajan
Year: 2012
Algorithm for Constructing Complete Distributive Lattice of Polyhedrons Defined over Three Dimensional Rectangular Grid- Part II
CCSIT PART III
Springer
DOI: 10.1007/978-3-642-27317-9_22
Abstract
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.
Copyright © 2012–2024 ICST
