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 4 of 4 for “"Graphics data structures"”.

  1. Hidden surface elimination using a topological data structure

    In computer graphics, data structures and hidden line/surface elimination are sometimes viewed as two different topics. This thesis presents a data structure designed especially for a hidden surface removal algorithm. In this data structure, the vital structural information of each object is …

    vt Repository record for Hidden surface elimination using a topological data structure (opens in a new tab)

  2. Concomitant hierarchy construction and rendering of large point clouds

    … preprocessing stage where a hierarchical data-structure is created before rendering. These algorithms do not consider presenting data before the hierarchy construction is finished. In this work we present OMiCroN – Oblique Multipass Hierarchy Creation while Navigating – which is the first …

    brazil-uerj Repository record for Concomitant hierarchy construction and rendering of large point clouds (opens in a new tab)

  3. Efficient Illumination Algorithms for Global Illumination In Interactive and Real-Time Rendering

    … fascinating domains in the field of computer graphics. Its main goal is the generation of visually stunning images, mimicking as close as possible the appearance of objects in the physical world. The endeavor for visual realism has directed a large amount of research interest in the …

    greece Repository record for Efficient Illumination Algorithms for Global Illumination In Interactive and Real-Time Rendering (opens in a new tab)

  4. 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)