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 8 of 8 for “"BSP trees"”.

  1. Building Efficient BSP Trees for Hidden Surface Removal and Ray Tracing

    A Binary Space Partitioning (BSP) tree represents a recursive, hierarchical partitioning, or subdivision, of n- dimensional space into convex subspaces. The BSP tree is extremely versatile because of its powerful sorting and classification structure. The BSP trees have been used in hidden surface …

    texas-state Repository record for Building Efficient BSP Trees for Hidden Surface Removal and Ray Tracing (opens in a new tab)

  2. Operações booleanas entre objetos delimitados por surfels usando constrained BSP-trees

    … de particionamento do espaço. Geralmente octrees e KD-trees, por utilizarem cortes alinhados com os eixos são preferidas em vez das BSP-trees, mais genéricas. Neste trabalho, apresenta-se uma estrutura chamada Constrained BSP-tree (CBSP-tree), que pode ser vista como uma estrutura …

    brazil-ufrgs Repository record for Operações booleanas entre objetos delimitados por surfels usando constrained BSP-trees (opens in a new tab)

  3. 3Dwm: Three-Dimensional User Interfaces Using Fast Constructive Solid Geometry

    … and one based on binary space partitioning (BSP) trees was selected as the basis for this implementation. Here, polyhedra are represented as solids using augmented BSP trees, and regularized Boolean set operations are performed through incremental construction of the resulting BSP trees. A …

    chalmers Repository record for 3Dwm: Three-Dimensional User Interfaces Using Fast Constructive Solid Geometry (opens in a new tab)

  4. Policy Extraction via Online Q-Value Distillation

    … limits their practical applicability. Decision Trees lend themselves well to explanation and verification tools but are not easy to train especially in an online fashion. The aim of this thesis is to explore online tree construction algorithms and demonstrate the technique and effectiveness of …

    waterloo Repository record for Policy Extraction via Online Q-Value Distillation (opens in a new tab)

  5. 3D hra v enginu Godot

    … generování levelů je implementováno použitím BSP stromů a generování nepřátel je implementováno spojováním menších částí dohromady.

    brno-tech Repository record for 3D hra v enginu Godot (opens in a new tab)

  6. A Scalable, Secure, and Energy-Efficient Image Representation for Wireless Systems

    … security levels. The binary space partitioning (BSP) tree presentation is selected because this representation allows convenient compression and scalable encryption. The Advanced Encryption Standard (AES) is chosen as the encryption algorithm because it is fast and secure. Our experimental result …

    waterloo Repository record for A Scalable, Secure, and Energy-Efficient Image Representation for Wireless Systems (opens in a new tab)

  7. Rychlý průsečík paprsku se scénou

    … optimalizací dělením prostoru, konkrétně pomocí BSP a KD stromů a jejich vzájemným srovnáním.

    brno-tech Repository record for Rychlý průsečík paprsku se scénou (opens in a new tab)