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 7 of 7 for “"k-d trees"”.

  1. Accelerating Ray Casting Using Culling Techniques to Optimize K-D Trees

    Ray tracing is a graphical technique that provides realistic simulation of light sources and complex lighting effects within three-dimensional scenes, but it is a time-consuming process that requires a tremendous amount of compute power. In order to reduce the number of calculations required to …

    calpoly Repository record for Accelerating Ray Casting Using Culling Techniques to Optimize K-D Trees (opens in a new tab)

  2. Multicore construction of k-d trees with applications in graphics and vision

    The k-d tree is widely used in graphics and vision applications for accelerating retrieval from large sets of geometric entities in R^k. Despite speeding up an otherwise brute force search, the time to construct and traverse the k-d tree remain a bottleneck in many applications. Increasing …

    uiuc Repository record for Multicore construction of k-d trees with applications in graphics and vision (opens in a new tab)

  3. Scalable Techniques for Trajectory Outlier Detection

    … using spatial data structures such as k-d trees and R-trees to improve the running time performance of the ODMTS algorithm for trajectory outlier detection. Our results showed that by using R-trees we can improve the execution time of ODMTS by a factor of 10X. Our second strategy consists …

    umn Repository record for Scalable Techniques for Trajectory Outlier Detection (opens in a new tab)

  4. Icosatree Data Partitioning of Massive Geospatial Point Clouds with User-Selectable Entities and Surface Modeling

    … in out-of-core rendering showed that using Octrees and k-d trees can increase the availability of data as well as allow a user to visualize the information in a much more useful manner. However, viewing the data isn’t enough; applying work in context-aware selection and surface creation the …

    rit Repository record for Icosatree Data Partitioning of Massive Geospatial Point Clouds with User-Selectable Entities and Surface Modeling (opens in a new tab)

  5. Tracking non-rigid objects in video

    … an implementation of the new system using k-d trees and dynamic programming. The second distinct contribution is an important extension to tracking algorithms in general. It can be noted that existing tracking algorithms occupy a spectrum in their use of global motion information. Local methods …

    oxford Repository record for Tracking non-rigid objects in video (opens in a new tab)

  6. A Massively Parallel Unstructured Overset Method for DNS/LES of Moving Bodies in Turbulent Flows

    … k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update …

    umn Repository record for A Massively Parallel Unstructured Overset Method for DNS/LES of Moving Bodies in Turbulent Flows (opens in a new tab)

  7. Βαθμονόμηση ρομποτικού βραχίονα – μηχανικής όρασης και σχεδιασμός συστήματος ελέγχου παρακολούθησης τροχιάς

    … by using 3D space sub-division based on KD-trees. The accuracy and time performance of the proposed method for calculating the position and orientation of an observed object renders the method attractive for practical visual tracking robotic application. The feasibility and performance of …

    greece Repository record for Βαθμονόμηση ρομποτικού βραχίονα – μηχανικής όρασης και σχεδιασμός συστήματος ελέγχου παρακολούθησης τροχιάς (opens in a new tab)