New Characterizations of Simple Points in 2D, 3D, and 4D Discrete Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence2009Vol. 31(4), pp. 637–648
Citations Over TimeTop 10% of 2009 papers
Abstract
A point of a discrete object is called simple if it can be deleted from this object without altering topology. In this article, we present new characterizations of simple points which hold in dimensions 2, 3 and 4, and which lead to efficient algorithms for detecting such points. In order to prove these characterizations, we establish two confluence properties of the collapse operation which hold in the neighborhood of a point in spaces of low dimension. This work is settled in the framework of cubical complexes, which provides a sound topological basis for image analysis, and allows to retrieve the main notions and results of digital topology, in particular the notion of simple point.
Related Papers
- → Algorithms in Digital Geometry Based on Cellular Topology(2004)37 cited
- → Digital Topology: Regular Sets and Root Images of the Cross-Median Filter(2002)17 cited
- → Topological structures in computer science(1987)51 cited
- Discrete geometry for computer imagery : 9th International Conference, DGCI 2000, Uppsala, Sweden, December 13-15, 2000 : proceedings(2000)
- → Discrete geometry for computer imagery : 7th International Workshop, DGCI '97, Montpellier, France, December 3-5, 1997 : proceedings(1997)2 cited