ii Acknowledgements iii

An algorithm is resented for con8tructing a quadtree from the array repre+@&oa of a binary u. %h e algorithm examines each pixel in the w once aasd only once. In addition, aa the tree ie con&u&d, only m&iial &ed nodea are ever cd. Thua the algorithm never requirea temporary nodes. The execution time of the B@-rithm is equal to the number of pixel43 in the we. The amount of sp&oe, in 84$& tion t...

Abstract We have developed a 2-D numerical meshless adaptive approach for phase-field modelling of dendritic solidification. The quadtree-based decomposes the computational domain into quadtree sub-domains different sizes. algorithm generates uniformly-distributed nodes in each sub-domain. apply radial basis function generated finite difference method and forward Euler scheme to discretise gove...

High Efficiency Video Coding (HEVC) is a proposed video compression standard, a successor to H.264/MPEG-4 AVC (Advanced Video Coding). It aims to substantially improve coding efficiency compared to H.264/AVC High Profile, in which transform unit (TU) has been added as one of the key advanced features, at the expense of traversal computation of transform and quantization quadtree. To release the...

The well-balanced, positivity-preserving scheme of Audusse et al, 2004, for the solution of the Saint-Venant equations with wetting and drying, is generalised to an adaptive quadtree spatial discretisation. The scheme is validated using an analytical solution for the oscillation of a fluid in a parabolic container, as well as the classic Monai tsunami laboratory benchmark. An efficient database...

A JBIG compliant, quadtree based, lossless image compression algorithm is described. In terms of the number of arithmetic coding operations required to code an image, this algorithm is signi cantly faster than previous JBIG algorithm variations. Based on this criterion, our algorithm achieves an average speed increase of more than 9 times with only a 5% decrease in compression when tested on th...

In this assignment you are required to implement an information management system for handling data similar to that used in VLSI (very large scale integration) as well as game programming applications. In such an environment the primary entities are small rectangles and the problem in which we are interested is how to manage a large collection of them. In the following we trace the development ...