Abstract. Existing theories on shape digitization impose strong constraints on feasible shapes and require error-free measurements. We use Delaunay triangulation and -shapes to pro...
Abstract. Designing interactive segmentation methods for digital volume images is difficult, mainly because efficient 3D interaction is much harder to achieve than interaction with...
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
Abstract. The notion of skeleton plays a major role in shape analysis. Some usually desirable characteristics of a skeleton are: sufficient for the reconstruction of the original o...
Duality applied to geometrical problems is widely used in many applications in computer vision or computational geometry. A classical example is the Hough Transform to detect linea...
Jean-Marc Chassery, David Coeurjolly, Isabelle Siv...
We propose a fast method for computing distance transforms and skeletons of 3D objects using programmable Graphics Processing Units (GPUs). We use an efficient method, called dista...
M. A. M. M. van Dortmont, H. M. M. van de Wetering...
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...