Finite topology as applied to image analysis
Computer Vision, Graphics, and Image Processing
Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
Handbook of combinatorics (vol. 2)
Constructions preserving evasiveness and collapsibility
Discrete Mathematics
New Characterizations of Simple Points in 2D, 3D, and 4D Discrete Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
In this paper, we first introduce the notion of a completion. Completions are inductive properties which may be expressed in a declarative way and which may be combined. In the sequel of the paper, we show that completions may be used for describing structures or transformations which appear in combinatorial topology. We present two completions, 〈CUP〉 and 〈CAP〉, in order to define, in an axiomatic way, a remarkable collection of acyclic complexes. We give few basic properties of this collection. Then, we present a theorem which shows the equivalence between this collection and the collection made of all simply contractible simplicial complexes.