Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 109 for “"quadtree"”.

  1. Quadtree algorithms for image processing

    … and efficient storage. The approach is known as quadtree (Q-Tree) encoding. The applications in this thesis are primarily to grayscale pixel images as opposed to simple binary images.

    rit Repository record for Quadtree algorithms for image processing (opens in a new tab)

  2. Table-driven quadtree traversal algorithms

    Two quadtree algorithms are presented that use table driven traversals to reduce the time complexity required to achieve their respective goals. The first algorithm is a two step process that converts a boundary representation of a polygon into a corresponding region representation of the same …

    vt Repository record for Table-driven quadtree traversal algorithms (opens in a new tab)

  3. Quadtree-based processing of digital images

    … In this thesis, two different operations on the quadtree are presented. There are, in general, two types of data compression techniques in image processing. One approach is based on elimination of redundant data from the original picture. Other techniques rely on higher levels of processing such …

    portland-state Repository record for Quadtree-based processing of digital images (opens in a new tab)

  4. Quadtree representation and compression of spatial data

    … graphics and image processing applications. Quadtrees, as one of hierarchical data structures, basing on the principle of recursive decomposition of space, always offer a compact and efficient representation of an image. For a given image, the choice of quadtree root node plays an important …

    brock Repository record for Quadtree representation and compression of spatial data (opens in a new tab)

  5. An adaptively-refined quadtree grid method for incompressible flows

    <p>A quadtree grid method used in conjunction with a pressure-based flow solution algorithm for the incompressible Navier-Stokes equations is presented. Two different flow solution methods are studied, each a cell-centered, primitive variable, finite volume procedure based on the SIMPLE algorithm. …

    iastate Repository record for An adaptively-refined quadtree grid method for incompressible flows (opens in a new tab)

  6. Hierarchical Reconstruction of Quadtree-Based Approximations of Incident Radiance

    … a method of hierarchically reconstructing quadtree-based approximations of incident radiance for path guiding. To that end, Gaussian denoising is applied by mapping quadtree data to matrices, performing regular matrix convolutions, and then mapping the data back to the quadtree. The …

    chalmers Repository record for Hierarchical Reconstruction of Quadtree-Based Approximations of Incident Radiance (opens in a new tab)

  7. Progressive image transmission by linear quadtree coding and wavelet transformation

    … channels. This thesis proposes to use linear quadtree encoding combined with wavelet based technique as well as other methods to achieve a hybrid coding progressive transmission system.

    ubc Repository record for Progressive image transmission by linear quadtree coding and wavelet transformation (opens in a new tab) Download PDF for Progressive image transmission by linear quadtree coding and wavelet transformation (opens in a new tab)

  8. Representation Of Dam-Breach Geometry Using Quadtree Local Mesh Refinement

    … done to facilitate the implementation of quadtree local mesh refinement to represent dam breach geometry in an existing two-dimensional flood model and to test the model's results and performance with several test cases. Results using local refinement agree with the results of global …

    mississippi Repository record for Representation Of Dam-Breach Geometry Using Quadtree Local Mesh Refinement (opens in a new tab)

  9. Memory-efficient emulation of physical tabular data using quadtree decomposition

    … domain discretization and mapping that utilizes quadtrees, which results in significant reductions in the size of the emulator with minimal increases to computational costs or loss of global accuracy. We apply our method to the electron-positron Helmholtz free energy equation of state and show …

    msu Repository record for Memory-efficient emulation of physical tabular data using quadtree decomposition (opens in a new tab)

  10. A non-recursive border finding algorithm for linear quadtree based images

    … a digital binary image represented in a linear quadtree, its border is to be found as another linear quadtree. A new algorithm is proposed that can generate the border in sorted order. A pattern is found for the order of the edge pixels of a node. The differences of the location codes for the …

    ubc Repository record for A non-recursive border finding algorithm for linear quadtree based images (opens in a new tab) Download PDF for A non-recursive border finding algorithm for linear quadtree based images (opens in a new tab)

  11. Filling contours on the linear quadtree domain by insertion and traversal

    … whose locations are given in unsorted linear quadtree (LQT) form. Each pixel requires an associated blocking code which indicates locally in which direction the region should grow. The technique takes advantage of certain characteristics of LQT location codes to determine if the boundary …

    ubc Repository record for Filling contours on the linear quadtree domain by insertion and traversal (opens in a new tab) Download PDF for Filling contours on the linear quadtree domain by insertion and traversal (opens in a new tab)

  12. Quadtree-based real-time point generalisation for web and mobile mapping

    … alle darin vorgeschlagenen Verfahren auf dem Quadtree beruhen, einer hierarchischen, räumlichen Datenstruktur. Obwohl der Quadtree für die kartographische Generalisierung interessante Eigenschaften aufweist, wurde diese Datenstruktur allerdings erst wenig für die Generalisierung verwendet. Der …

    zurich

  13. Suitability of the Quadtree as a Spatial Index for Soundscape Maps

    … finger in real time. This project evaluates the quadtree as a data structure that will these requirements, by testing the size of the quadtrees created by large amounts of data and the retrieval time of a node, given these trees. It shows that a quadtree structure allows objects to be found …

    oregon Repository record for Suitability of the Quadtree as a Spatial Index for Soundscape Maps (opens in a new tab)

  14. Adaptive mesh refinement for a finite difference scheme using a quadtree decomposition approach

    … algorithm for a finite difference scheme using a quadtree decomposition approach. In the AMR algorithm developed, a mesh of increasingly fine resolution permits high resolution computation in sub-domains of interest and low resolution in others. In this thesis work, the gradient of the solution …

    tamu Repository record for Adaptive mesh refinement for a finite difference scheme using a quadtree decomposition approach (opens in a new tab)

  15. A distributed Quadtree Dictionary approach to multi-resolution visualization of scattered neutron data

    … energy physics data. Specifically, we propose a Quadtree Dictionary (QTD) algorithm to provide lossless, multi-resolution compression of datasets and enable their visualization on devices of all capabilities. As a prototype application, we extend the Integrated Spectral Analysis Workbench (ISAW) …

    lsu-thes Repository record for A distributed Quadtree Dictionary approach to multi-resolution visualization of scattered neutron data (opens in a new tab)

  16. An Adaptive Well-Balanced Positivity Preserving Central-Upwind Scheme for the Shallow Water Equations Over Quadtree Grids

    … scheme for the shallow water equations over quadtree grids. Quadtree grids are two-dimensional semi-structured Cartesian grids that have different applications in several fields of engineering, such as computational fluid dynamics. Quadtree grids refine or coarsen where it is required in the …

    ottawa-retro Repository record for An Adaptive Well-Balanced Positivity Preserving Central-Upwind Scheme for the Shallow Water Equations Over Quadtree Grids (opens in a new tab)

  17. A paging scheme for pointer-based quadtrees

    The quadtree is a family of data structures that organize spatial data using recursive subdivision. A pointer-based quadtree uses an explicit tree structure to represent the subdivision, while a linear quadtree holds a sorted list of records corresponding to the leaves of the tree structure. Small …

    vt Repository record for A paging scheme for pointer-based quadtrees (opens in a new tab)

  18. A 2-D and 3-D robot path planning algorithm based on quadtree and octree representation of the workspace

    … path planning to 3-D with minimal effort. The quadtree and octree structures are used for 2-D and 3-D workspace representation, respectively. The quadtree and octree is generated from brightness image of the workspace obtained using a camera mounted on a robot. Path generation is based on the …

    ut-knoxville Repository record for A 2-D and 3-D robot path planning algorithm based on quadtree and octree representation of the workspace (opens in a new tab)

Page 1 of 6