Search for dissertations about: "Directed acyclic graph"
Showing result 1 - 5 of 15 swedish dissertations containing the words Directed acyclic graph.
-
1. Exploiting Coherence in Voxelized Geometry
Abstract : In computer graphics, the geometry of virtual worlds can be represented in numerousways, from collections of simple triangles or voxels to higher-order primitives likecurved surfaces. There is a trade-off, both in terms of memory consumption and processingtime, between the cost of an individual primitive and the number of primitivesrequired to faithfully represent the world. READ MORE
-
2. Sparse Voxel DAGs
Abstract : This thesis investigates a memory-efficient representation of highly detailed geometry in 3D voxel grids. The memory consumption of a plain dense grid scales too fast as the resolution increases to be feasible at very high resolutions. READ MORE
-
3. Sparse Voxel DAGs for Shadows and for Geometry with Colors
Abstract : Triangles are probably the most common format for shapes in computer graphics. Nevertheless, when high detail is desired, Sparse Voxel Octrees (SVO) and Sparse Voxel Directed Acyclic Graphs (DAG) can be considerably more memory efficient. One of the first practical use cases for DAGs was to use the structure to represent precomputed shadows. READ MORE
-
4. On sparse voxel DAGs and memory efficient compression of surface attributes for real-time scenarios
Abstract : The general shape of a 3D object can expeditiously be represented as, e.g., triangles or voxels, while smaller-scale features usually are parameterized over the surface of the object. READ MORE
-
5. All Around Logic Synthesis
Abstract : This dissertation is in the area of Computer-Aided Design (CAD) of digital Integrated Circuits (ICs). Today's digital ICs, such as microprocessors, memories, digital signal processors (DSPs), etc., range from a few thousands to billions of logic gates, flip-flops, and other components, packed in a few millimeters of area. READ MORE