Search Constraints

Start Over
Filtering by: Creator Welch, E. B. (Eugene B.) Remove constraint Creator: Welch, E. B. (Eugene B.) Committee Member Zhang, Eugene Remove constraint Committee Member: Zhang, Eugene Peer Reviewed No Remove constraint Peer Reviewed: No

Search Results

  • A Structural Theorem For Shortest Vertex-Disjoint Paths Computation in Planar Graphs

    Creator:
    Zafarani, Farzad
    Abstract:
    Given k terminal pairs (s₁,t₁),(s₂,t₂),..., (s[subscript k],t[subscript k]) in an edge-weighted graph G, the k Shortest Vertex-Disjoint Paths problem is to find a collection P₁, P₂,..., P[subscript k] of vertex-disjoint paths with minimum total length, where P[subscript i] is an s[subscript i]-to-t[subscript i] path. As a special case of the...
    Resource Type:
    Masters Thesis
    Full Text:
    intersection of α and β) if α and β do not cross. We say that an endpoint e of B is a touching point if simple

  • Information space mapping with adaptive multiplicatively weighted Voronoi diagrams

    Creator:
    Trubin, Stanislav I.
    Abstract:
    Traditional application of Voronoi diagrams for space partitioning creates Voronoi regions, with areas determined by the generators’ relative locations and weights. Especially in the area of information space (re)construction, however, there is a need for inverse solutions; i.e., finding weights that result in regions with predefined areas. In this thesis,...
    Resource Type:
    Masters Thesis
    Full Text:
    0.01 0.1 1 0 200 400 600 800 1000 Iterations R el at iv e er ro r (b) 0.00001 0.0001

  • The Horizon Measure: A New Look at Curvature

    Creator:
    Mills, Arthur M.
    Abstract:
    An important problem in computer graphics is to determine where contour lines and ridges appear in a surface constructed from a triangle mesh. In this presentation we will investigate a new answer to this problem – the horizon measure. The horizon measure determines the likelihood of contour lines to appear...
    Resource Type:
    Capstone Project
    Full Text:
    function s : [a, b]→ R defined by s(t) = ∫ t a √ Iα(t)(α′(t)) dt = ∫ t a √ E(u′)2 + 2Fu′v′ +G(v′)2 dt

  • New Approaches to Depth-Based Render Techniques Using Pixel Synchronization

    Creator:
    Pawlowski, Bryan
    Abstract:
    As the nonstop advancement of graphics hardware continues, new features are being added to the graphics pipeline on a regular basis. One of these advancements is called Pixel Synchronization, which allows a graphics programmer more power with certain types of data structures that may be accessed by multiple shader units...
    Resource Type:
    Masters Thesis
    Full Text:
    PSExample ( /∗ p a r a m e t e r s . . . ∗/ ) : SV TARGET 2 { 3 4 // V a r i a b l e D e f i n i t i o n s 5

  • Interactive Methods for Authoring Behaviors of Multiple Agents

    Creator:
    Iyer, Vikram
    Abstract:
    Virtual environments and simulations are being used increasingly to both visualize and understand data as well as to create scenarios for training and analysis purposes. In this paper, we are interested in the use of simulation and visualization of interactive virtual agents to create realistic motions for training scenarios. We...
    Resource Type:
    Capstone Project
    Full Text:
    leverage, player A maintaining an inside leverage with respect to an opponent player B always tries to

  • A Study of Planar and Spherical Stereographics for Visualization

    Creator:
    AlSalehy, Ali S.
    Abstract:
    ”Until relatively recently, mankind was not aware that there was a separable binocular depth sense. Through the ages, people like Euclid and Leonardo understood that we see different images of the world with each eye. But it was Wheatstone who in 1838 explained to the world, with his stereoscope and...
    Resource Type:
    Capstone Project
    Full Text:
    contributed to my education, especially Professors Mike Bailey, Bella Bose, Lizhong Chen, and Eugene Zhang

  • Visualizing Large Datasets on Memory and Performance Constrained Mobile Devices

    Creator:
    Schultz, Chris
    Abstract:
    Graphics hardware in mobile devices has become more powerful, allowing rendering techniques such as ray-cast volume rendering to be done at interactive rates. This increase of performance provides desktop capabilities combined with the portability of a tablet. Volumes can demand a high amount of memory in order to be loaded...
    Resource Type:
    Capstone Project
    Full Text:
    ................................................................................................ 52 Appendix B – Ray-Casting Algorithm

  • Numerical study of flow maldistribution in microchannels using fully resolved simulation

    Creator:
    Martin, Mathieu Georges Charles
    Abstract:
    This thesis addresses numerical simulation of flow maldistribution in microchannels. Microchannels are often associated with two phase-flows which can generate many problems such as plugging the channel or perturbing the flow. In this study we have used CFD and fully resolved technique to simulate what would happen in the case...
    Resource Type:
    Masters Thesis
    Full Text:
    ic ro ch an n el s w it h b u b b ly fl ow an d fl ow m al d is tr ib u ti on . 4

  • Benchmarking and Programming Practices for the Intel Xeon Phi Coprocessor

    Creator:
    Leslie, William
    Abstract:
    The Intel Xeon Phi is a relative newcomer to the scientific computing scene. In the recent years, GPUs have been used extensively for mathematical simulations. The Xeon Phi is Intel’s response to the use of these cards. Like the GPU, it is highly parallelizable but can be programmed like a...
    Resource Type:
    Capstone Project
    Full Text:
    member of my Masters defense committee. Finally, I would like to thank Dr. Eugene Zhang, a wonderful

  • On the Existence of Solutions to the Incompressible Navier-Stokes Equations with Constant Energy and Enstrophy

    Creator:
    Hagen, Sarah S.
    Abstract:
    In this dissertation, we use Fourier-analytic and spectral theory methods to analyze the behavior of solutions of the incompressible Navier-Stokes equations in 2D and 3D (with an eye towards better understanding turbulence). In particular, we investigate the possible existence of so-called ghost solutions to the Navier-Stokes Equations. Such solutions, if...
    Resource Type:
    Dissertation
    Full Text:
    defined on an open interval I. If d dt u(t) ≤ a(t)u(t) + b(t) then u(t) ≤ u(t0)e ∫ t t0 a(s)ds + e ∫ t