This report presents an implementation of a stable height-field fluid solver on non-uniform quadtree grids. It build upon the well known techniques of height field representation of the fluid volume, semi-Lagrangian advection, upwind differencing in the discretized representation and adaptive quadtree grids for faster calculations. A novel contribution is the applications of certain concepts an...

Title of dissertation: DYNAMIC DATA STRUCTURES FOR GEOMETRIC SEARCH AND RETRIEVAL Eunhui Park, 2013 Dissertation directed by: Professor David M. Mount Department of Computer Science Data structures for geometric search and retrieval are of significant interest in areas such as computational geometry, computer graphics, and computer vision. The focus of this dissertation is on the design of effi...

An analysis of the expected size occupied by a Quadtree is presented. The analysis is based on the general assumption that the storage requirements of internal and external nodes differ. Besides, formulae for the expected number of internal and external nodes at a specific level of the tree are given. Next, the space efficiency of the most popular Quadtree implementations is examined. Finally, ...

This paper presents the use of hierarchical spatial data structures to visualise attribute and spatial uncertainty when using spatial information systems. This is demonstrated using spatially-referenced data from the New Zealand 2001 Census. Firstly, selected current spatial visualisations created to show uncertainty were assessed in an Internet survey, revealing that overall there is not many ...

This paper describes parallel algorithms for the following operations on qua.dtreesboolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a. hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the...