A Versatile Framework for Handling Subdivided Geometric Objects Combinatorial Maps:
Efficient Data Structures for Computer Graphics and Image Processing gathers important …

In this paper we present a data structure that improves region segmentation of 2D images.
This data structure provides an efficient access to both geometric features such as the set of …

Combinatorial maps describe the subdivision of objects in cells, and incidence and
adjacency relations between cells, and they are widely used to model 2D and 3D images …

Split-and-merge algorithms define a class of image segmentation methods. Topological
maps are a mathematical model that represents image subdivisions in 2D and 3D. This …

In this paper, we define the two-dimensional topological map, a model which represents
both topological and geometrical information of a two-dimensional labeled image. Since this …

In this paper, we define the three-dimensional topological map, a model which represents
both the topological and geometrical information of a three-dimensional labeled image …

The aim of this work is to provide a means to approximate the real boundary underlying the
discrete boundary of a digitized 2D region. We require that the sampling of the reconstructed …

In this paper, we present an algorithm which allows to compute efficiently generators of the
first homology group of a closed surface, orientable or not. Starting with an initial subdivision …

The data structure used to encode an image partition is of critical importance for most of
region-based segmentation algorithms. Usual data structures are often convenient to extract …

Most models of representation of a segmented image have been designed to perform
specific processing on images and are generally ill-adapted to other processes. Moreover …