Browsing Computer Science Theses and Dissertations by Subject "Scientific Visualization"

Navigation

Display Options

Results

  • An Algorithm for Clipping Polygons of Large Geographical Data 
    Alghamdi, Areej (University of Oregon, 2017-09-27)
    We present an algorithm for overlaying polygonal data with regular grids and calculating the percentage overlap for each cell in the regular grid.  Our algorithm is able to support self-intersecting polygons, meaning that ...
  • Automating Camera Placement for In Situ Visualization 
    Marsaglia, Nicole (University of Oregon, 2022-05-10)
    Trends in high-performance computing increasingly require visualization to be carried out using in situ processing. This processing most often occurs without a human in the loop, meaning that the in situ software must be ...
  • Efficient Parallel Particle Advection via Targeting Devices 
    Belcher, Kristi (University of Oregon, 2020-09-24)
    Particle advection is a fundamental operation for a wide range of flow visualization algorithms. Particle advection execution times can vary based on many factors, including the number of particles, duration of advection, ...
  • Establishing the Viability and Efficacy of In Situ Reduction Via Lagrangian Representations for Time-Dependent Vector Fields 
    Sane, Sudhanshu (University of Oregon, 2020-09-24)
    Exploratory visualization and analysis of time-dependent vector fields or flow fields generated by scientific simulations is increasingly challenging on modern supercomputers. One possible solution is the use of a ...
  • Evaluating Parallel Particle Advection Algorithms Over Various Workloads 
    Binyahib, Roba (University of Oregon, 2020-09-24)
    We consider the problem of efficient particle advection in a distributed- memory parallel setting, focusing on four popular parallelization algorithms. The performance of each of these algorithms varies based on the desired ...
  • General Purpose Flow Visualization at the Exascale 
    Yenpure, Abhishek (University of Oregon, 2023-03-24)
    Exascale computing, i.e., supercomputers that can perform 1018 math operations per second, provide significant opportunity for improving the computational sciences. That said, these machines can be difficult to use ...
  • The Time Slice Selection Bake-off 
    Kawakami, Yuya (University of Oregon, 2022-10-04)
    As the size of data from scientific simulations grows, the ability to identify key time steps in a simulation has emerged as a key challenge. In response, a number of time slice selection methods and algorithms have been ...

Search Scholars' Bank


Advanced Search

Browse

My Account

Statistics