A geometric model for activ contours in image processing.
A limit theorem for one-parameter alteration of two knots of B-spline curves.
A linear time algorithm for the computation of some distance functions between convex polygons
A modification of Graham's algorithm for determining the convex hull of a finite planar set.
A new 4-point quaternary approximating subdivision scheme.
A new source of structured singular value decomposition problems.
A topological asymptotic analysis for the regularized grey-level image classification problem
The aim of this article is to propose a new method for the grey-level image classification problem. We first present the classical variational approach without and with a regularization term in order to smooth the contours of the classified image. Then we present the general topological asymptotic analysis, and we finally introduce its application to the grey-level image classification problem.
About the geometry of milling paths.
Algorithm for the Gröbner region of a principal ideal.
An Implementation of Ray Tracing Algorithm for the Multiprocessor Machines
Application of the partitioning method to specific Toeplitz matrices
We propose an adaptation of the partitioning method for determination of the Moore-Penrose inverse of a matrix augmented by a block-column matrix. A simplified implementation of the partitioning method on specific Toeplitz matrices is obtained. The idea for observing this type of Toeplitz matrices lies in the fact that they appear in the linear motion blur models in which blurring matrices (representing the convolution kernels) are known in advance. The advantage of the introduced method is a significant...
Approximating the MaxMin and MinMax Area Triangulations using Angular Constraints
* A preliminary version of this paper was presented at XI Encuentros de Geometr´ia Computacional, Santander, Spain, June 2005.We consider sets of points in the two-dimensional Euclidean plane. For a planar point set in general position, i.e. no three points collinear, a triangulation is a maximal set of non-intersecting straight line segments with vertices in the given points. These segments, called edges, subdivide the convex hull of the set into triangular regions called faces or simply triangles. We...
Approximation in the space of planes: applications to geometric modeling and reverse engineering.
Se estudia la aproximación en el espacio de planos. Se introduce una medida de la distancia en este espacio, con la que pueden resolverse problemas de modelado con superficies desarrollables mediante algoritmos de aproximación de curvas. Además, el reconocimiento y reconstrucción de caras planas en nubes de puntos aparecen como un problema "clustering" en el espacio de planos. La aplicabilidad práctica de estos resultados se muestra en varios ejemplos.
Asymptotic analysis of implicit tolerance problems.