Minimal non-simple sets in 4D binary images
| Autor: | T. Yung Kong, C. J. Gau |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
Binary image
Topology (electrical circuits) Computer Graphics and Computer-Aided Design Regular grid law.invention Set (abstract data type) Simple (abstract algebra) law Modeling and Simulation Component (UML) Thinning algorithm Cartesian coordinate system Geometry and Topology Algorithm Software Mathematics |
| Zdroj: | Graphical Models. 65:112-130 |
| ISSN: | 1524-0703 |
| Popis: | One way to verify that a proposed parallel thinning algorithm "preserves topology" is to check that no iteration can ever delete a minimal non-simple ("MNS") set. This is a practical verification method because few types of set can be MNS without being a component. Ronse, Hall, Ma, and the authors have solved the problem of finding all such types of set for 2D and 3D Cartesian grids, 2D hexagonal grids, and 3D face-centered cubic grids. Here we solve this problem for a 4D Cartesian grid, in the case where 80-adjacency is used on 1's and 8-adjacency on 0's. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect