Fast surface tracking in three-dimensional binary images
Computer Vision, Graphics, and Image Processing
Finite topology as applied to image analysis
Computer Vision, Graphics, and Image Processing
A topologically consistent representation for image analysis: the Topological Graph of Frontiers
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Border Map: A Topological Representation for nD Image Analysis
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
A Topological Method of Surface Representation
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
A New Means for Investigating 3-Manifolds
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
A comparative discussion of distance transforms and simple deformations in digital image processing
Machine Graphics & Vision International Journal
Journal of Mathematical Imaging and Vision
Spatial Organization of the Chemical Paradigm and the Specification of Autonomic Systems
Software-Intensive Systems and New Computing Paradigms
Thinning on cell complexes from polygonal tilings
Discrete Applied Mathematics
Thinning on quadratic, triangular, and hexagonal cell complexes
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Polyhedral surface approximation of non-convex voxel sets through the modification of convex hulls
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Algorithms in digital geometry based on cellular topology
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
| Hi-index | 0.01 |
The paper presents an introduction to computer topology with applications to image processing and computer graphics. Basic topological notions such as connectivity, frontier, manifolds, surfaces, combinatorial homeomorphism etc. are recalled and adapted for locally finite topological spaces. The paper describes data structures for explicitly representing classical topological spaces in computers and presents some algorithms for computing topological features of sets. Among them are: boundary tracing (n=2,3), filling of interiors (n=2,3,4), labeling of components, computing of skeletons and others.