Block based texture synthesis algorithms have shown better results than others as they help to preserve the global structure. Previous research has proposed several approaches in the pixel domain, but little effort has been taken in the synthesis of texture in a multiresolution domain. We propose a multiresolution framework in which coefficient-blocks of the spatio-frequency components of the input texture are efficiently stitched together to form the corresponding components of the output texture. We propose two algorithms to this effect. In the first, we use a constant block size throughout the algorithm. In the second, we adaptively split blocks so as to use the largest possible block size in order to preserve the global structure, while maintaining the mismatched error of the overlapped boundaries below a certain error tolerance. Special consideration is given to minimization of the computational cost, throughout the algorithm designs. We show that the adaptation of the multiresolution approach results in a fast, cost-effective, flexible texture synthesis algorithm that is capable of being used in modern, bandwidth-adaptive, real-time imaging applications. A collection of regular and stochastic test textures is used to prove the effectiveness of the proposed algorithm.

Abstract With the wide availability of general purpose parallel computers, there is a need to reconsider hidden surface elimination (HSE) algorithms with respect to parallel implementation. This paper considers MIMD parallel implementations off our common image space HSE algorithms ‐ recursive subdivision, scan line, painter's, and z‐buffer. Their suitability for parallel implementation is investigated and their relative performance in multiprocessor systems is measured using polygonal scene descriptions of between 200 and 2500 polygons. Dependence on the size of scene description is measured and results are extrapolated to larger scene descriptions. It is shown that HSE algorithms may be efficiently parallelised. A distributed z‐buffer is shown to be a fast and efficient method of solving HSE problems using parallel computers.

Abstract A new method of parameterization, based on areas, is suggested and some results obtained for planar cubic curves are presented and compared with standard methods. The new technique provides a “tight” interpolant, is axis independent and offers shape control via a set of off geometry data points (henceforth called poles) relative to which areas are computed. A simple algorithm for the computation of initial pole positions is given (this is based on obtaining agreement with a standard parameterized curve on the same data and with identical geometrical end conditions). Some additional properties of the parameterization are discussed including its limiting behaviour and its applicability to function drawing.