Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...
Abstract. We present in this paper robust geometric feature estimators on the border of a possibly noisy discrete object. We introduce the notion of patch centered at a point of th...
In this paper we introduce a new curvature estimator based on global optimisation. This method called Global Min-Curvature exploits the geometric properties of digital contours by ...
Abstract. Segmentation is an important step to obtain quantitative information from tomographic data sets. To this end, global thresholding is often used in practice. However, it i...
This paper presents the first segmentation operation defined within the 3D topological map framework. Firstly we show how a traditional segmentation algorithm, found in the literat...
A novel method for segmenting simplified skeletons of 3D shapes is presented. The so-called simplified Y-network is computed, defining boundaries between 2D sheets of the simplifie...
In this paper, we introduce a method to express a local linear operated in the neighbourhood of each point in the discrete space as a matrix transform. To derive matrix expressions...
Abstract. We present a novel template matching framework for detecting geometrically transformed objects. A template is a simplified representation of the object of interest by a s...
Toric spaces being non-simply connected, it is possible to find in such spaces some loops which are not homotopic to a point: we call them toric loops. Some applications, such as t...