Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée
Multichannel deblurring of digital images
Blur is a common problem that limits the effective resolution of many imaging systems. In this article, we give a general overview of methods that can be used to reduce the blur. This includes the classical multi-channel deconvolution problems as well as challenging extensions to spatially varying blur. The proposed methods are formulated as energy minimization problems with specific regularization terms on images and blurs. Experiments on real data illustrate very good and stable performance of...
New algorithms and techniques for computing with geometrically continuous spline curves of arbitrary degree
Non-monotoneous parallel iteration for solving convex feasibility problems
The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in an Euclidean space, sometimes leads to slow convergence of the constructed sequence. Such slow convergence depends both on the choice of the starting point and on the monotoneous behaviour of the usual algorithms. As there is normally no indication of how to choose the starting point in order to avoid slow convergence, we present in this paper a non-monotoneous parallel algorithm...
Note on symmetric alteration of knots of B-spline curves.
Numerical solution of inverse spectral problems for Sturm-Liouville operators with discontinuous potentials
We consider Sturm-Liouville differential operators on a finite interval with discontinuous potentials having one jump. As the main result we obtain a procedure of recovering the location of the discontinuity and the height of the jump. Using our result, we apply a generalized Rundell-Sacks algorithm of Rafler and Böckmann for a more effective reconstruction of the potential and present some numerical examples.
O triangulacích bez tupých úhlů
On a Construction of Digital Convex -gons of Minimum Diameter
On piecewise linear approximation of quadratic functions.
On the axonometrical projection in the computer graphics.
On the Generation of Heronian Triangles
We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O(n^(2+ε)). We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems.
On the motion of a curve by its binormal curvature
We propose a weak formulation for the binormal curvature flow of curves in . This formulation is sufficiently broad to consider integral currents as initial data, and sufficiently strong for the weak-strong uniqueness property to hold, as long as self-intersections do not occur. We also prove a global existence theorem in that framework.
On the singular decomposition of matrices.
On -manifolds and -surfaces for analysis of the convergence of mesh-based approximation.
Optimization of the Raster-Scan Circle-Drawing Algorithm Based on Predicate Transformers
Orthogonal grids on meander-like regions.
Polar cylinders of surfaces of revolution: Contour line determination.
Použití samočinných počítačů a automatického kreslení v deskriptivní geometrii
Problems with defining barycentric coordinates for the sphere
Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time...