[[abstract]]Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two requirements: (1) minimum mean square error and (2) fixed reduction ratio between levels, this paper first transforms the MRQSA problem into the problem of solving a sequence of near-Toeplitz tridiagonal linear systems. Employing the matrix perturbation technique, the MRQSA problem can be solved using about 24mn floating-point operations, i.e. linear time, if we are given a polygonal surface with (2m–1)×(2n–1) points. A numerical stability analysis is also given. To the best of our knowledge, this is the first time that such a linear algebra approach has been use...
Abstract. Recently we developed multiscale spaces of C1 piecewise quadratic polynomials on the Powel...
The thesis studies the optimization of a specific type of computer graphic representation: polygon-b...
AbstractIn this note, we present linear-time algorithms for computing the median set of plane triang...
Motivated by applications in computer graphics, we study the problem of computing an optimal encodin...
Consider a triangulation of the xy plane, and a general surface z = f (xy). The points of the trian...
AbstractSolving special tridiagonal systems often arise in the fields of engineering and science. Th...
We discuss the problem of adaptive polygonization of regular surfaces of the euclidean 3D space, and...
Besides triangle meshes, quadrilateral meshes are the most prominent discrete representation of surf...
We introduce an approach to quadrilateral meshing of arbitrary triangulated surfaces that combines t...
We investigate how to define a triangulated ruled surface interpolating two polygonal directrices th...
Ruled surfaces play an important role in many manufacturing and construction applications. In this w...
A fundamental algorithmic problem in computer graphics is that of computing a succinct encoding of a...
An algorithm is proposed to generate quadrilateral elements over a triangular element mesh by select...
AbstractDiagonally dominant tridiagonal Toeplitz systems of linear equations arise in many applicati...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
Abstract. Recently we developed multiscale spaces of C1 piecewise quadratic polynomials on the Powel...
The thesis studies the optimization of a specific type of computer graphic representation: polygon-b...
AbstractIn this note, we present linear-time algorithms for computing the median set of plane triang...
Motivated by applications in computer graphics, we study the problem of computing an optimal encodin...
Consider a triangulation of the xy plane, and a general surface z = f (xy). The points of the trian...
AbstractSolving special tridiagonal systems often arise in the fields of engineering and science. Th...
We discuss the problem of adaptive polygonization of regular surfaces of the euclidean 3D space, and...
Besides triangle meshes, quadrilateral meshes are the most prominent discrete representation of surf...
We introduce an approach to quadrilateral meshing of arbitrary triangulated surfaces that combines t...
We investigate how to define a triangulated ruled surface interpolating two polygonal directrices th...
Ruled surfaces play an important role in many manufacturing and construction applications. In this w...
A fundamental algorithmic problem in computer graphics is that of computing a succinct encoding of a...
An algorithm is proposed to generate quadrilateral elements over a triangular element mesh by select...
AbstractDiagonally dominant tridiagonal Toeplitz systems of linear equations arise in many applicati...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
Abstract. Recently we developed multiscale spaces of C1 piecewise quadratic polynomials on the Powel...
The thesis studies the optimization of a specific type of computer graphic representation: polygon-b...
AbstractIn this note, we present linear-time algorithms for computing the median set of plane triang...