Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Discrete Combinatorial Surfaces
Graphical Models and Image Processing
Two linear time Union-Find strategies for image processing
Theoretical Computer Science
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
Polyhedra generation from lattice points
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Determining the components of the complement of a digital (n-1)-manifold in Zn
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Aspects in Topology-Based Geometric Modeling
DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery
On recent trends in discrete geometry in computer science
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Algorithms and Data Structures for Computer Topology
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Topological Encoding of 3D Segmented Images
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Abstraction Pyramids on Discrete Representations
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
XPMaps and Topological Segmentation - A Unified Approach to Finite Topologies in the Plane
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Grouping of non-connected structures by an irregular graph pyramid
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Topological map: an efficient tool to compute incrementally topological features on 3d images
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.00 |
This article presents an algorithm computing a border map of an image that generalizes to the n dimension graph structures used in image analysis. Such a map represents simple and multiple adjacencies, inclusion of regions, as well as the frontier type between two adjacent regions. An algorithm computing a border map, linear to the number of elements of an image, is defined in 2D, then generalized in 3D and in nD.