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 20 of 78 for “"Geometric algorithms"”.

  1. Fast geometric algorithms

    … includes sorting and selection, convex hull algorithms, the L₁ hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L₁ diameter of a set of points, the metric traveling salesman problem, and finding the superrange of starshaped and monotone polygons. The …

    vt Repository record for Fast geometric algorithms (opens in a new tab)

  2. Geometric Algorithms for Objects in Motion

    In this thesis, the theoretical analysis of real-world motivated problems regarding objects in motion is considered. Specifically, four major results are presented addressing the issues of robustness, data collection and compression, realistic theoretical analyses of this compression, and data …

    maryland Repository record for Geometric Algorithms for Objects in Motion (opens in a new tab)

  3. Efficient Geometric Algorithms for Wireless Networks

    … This dissertation discusses the application of geometric optimization in wireless networks where the communication \links" are not static but may be dynamically changing. We show how to exploit the geometric properties of these networks to model their behavior. In the first part of the …

    arizona-thes Repository record for Efficient Geometric Algorithms for Wireless Networks (opens in a new tab)

  4. Geometric algorithms for interpretable manifold learning

    This thesis proposes several algorithms in the area of interpretable unsupervised learning.Chapters 3 and 4 introduce a sparse convex regression approach for identifying local diffeomor- phisms from a dictionary of interpretable functions. In Chapter 3, this algorithm makes use of an embedding …

    washington Repository record for Geometric algorithms for interpretable manifold learning (opens in a new tab)

  5. Geometric Algorithms for Intervals and Related Problems

    … related to intervals and develop efficient algorithms for them. Interval problems have many applications in reality because many objects, values, and ranges are intervals in nature, such as time intervals, distances, line segments, probabilities, etc. Problems on intervals are gaining …

    utahstate Repository record for Geometric Algorithms for Intervals and Related Problems (opens in a new tab)

  6. The Limited Workspace Model for Geometric Algorithms

    … in the subject. As a result, the design of algorithms for the limited workspace model has seen a significant rise in popularity in computational geometry over the last decade. In this setting, we typically have a large amount of data that needs to be processed. Although we may access the …

    fu-berlin Repository record for The Limited Workspace Model for Geometric Algorithms (opens in a new tab)

  7. Geometric Algorithms for Modeling Plant Roots from Images

    … crop yield. In this dissertation we develop geometric approaches to non-destructively characterize the full architecture of the root system from 3D imaging while making com- putational advances in topological optimization. First, we develop a global optimization algorithm to remove …

    wustl Repository record for Geometric Algorithms for Modeling Plant Roots from Images (opens in a new tab)

  8. EFFICIENT GEOMETRIC ALGORITHMS FOR STOCHASTIC AND CATEGORICAL DATA

    … uncertain. This dissertation explores efficient geometric algorithms for handling such data across two regimes: temporal evolution and spatial classification. In the first part, we address "temporal uncertainty" by developing algorithms to track evolving data. We introduce a framework for …

    maryland Repository record for EFFICIENT GEOMETRIC ALGORITHMS FOR STOCHASTIC AND CATEGORICAL DATA (opens in a new tab)

  9. Graph and geometric algorithms on distributed networks and databases

    In this thesis, we study the power and limit of algorithms on various models, aiming at applications in distributed networks and databases. In distributed networks, graph algorithms are fundamental to many applications. We focus on computing random walks which are an important primitive employed in …

    gatech Repository record for Graph and geometric algorithms on distributed networks and databases (opens in a new tab)

  10. GPU-accelerated geometric algorithms for computational modeling and simulation

    … Finally, it is difficult to visualize any isogeometric analysis (IGA) results due to difficulty rendering NURBS surfaces. We have developed a GPU accelerated volume visualization method using a modified ray intersection test. Our direct voxelization approach eliminated the need to store …

    iastate Repository record for GPU-accelerated geometric algorithms for computational modeling and simulation (opens in a new tab)

  11. Geometric Algorithms and Data Structures for Simulating Diffusion Limited Reactions

    … treap data structure in order to investigate the algorithms scalability. The treap provides a way for each thread of execution to do more work in a particular region of space. A comparison with a spatial discretization variant of the algorithm is also provided.

    unm Repository record for Geometric Algorithms and Data Structures for Simulating Diffusion Limited Reactions (opens in a new tab)

  12. Graph-theoretic and geometric algorithms associated with moment-based polygon reconstruction

    … and partial information (expressed in terms of geometric constraints) about the edges bounding P, we examine the problem of constructing polygonal regions con sistent with this information. Although in practice, the vertex positions and edge constraints may contain error in their specifications …

    ubc Repository record for Graph-theoretic and geometric algorithms associated with moment-based polygon reconstruction (opens in a new tab) Download PDF for Graph-theoretic and geometric algorithms associated with moment-based polygon reconstruction (opens in a new tab)

  13. On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures

    … optimally as far as comparison-based algorithms are concerned, but there has been little work focusing on improving the constant factors hidden in big-Oh bounds on the number of comparisons needed. In this thesis, we consider orthogonal-type problems and present a number of results …

    waterloo Repository record for On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures (opens in a new tab)

  14. Algebro-geometric algorithms for program synthesis, tensor networks, and conditional independence models

    Deze dissertatie onderzoekt Algebro-Geometrische Algoritmen in Programmasynthese, Tensornetwerken, en Conditionele Onafhankelijkheidsmodellen. In Programmasynthese draagt het onderzoek bij aan template-gebaseerde synthese voor polynomiale imperatieve programma's, bewijst beslisbaarheid, ontwikkelt …

    ghent Repository record for Algebro-geometric algorithms for program synthesis, tensor networks, and conditional independence models (opens in a new tab)

  15. Geometric Algorithms for Protein Structure Determination Using Measurements From Nuclear Magnetic Resonance Spectroscopy

    … the trade-off for guaranteeing completeness of algorithms for structure determination is often an exponential running time, for some methods, we remarkably obtained polynomial running times in addition to guarantees of completeness.</p>

    duke Repository record for Geometric Algorithms for Protein Structure Determination Using Measurements From Nuclear Magnetic Resonance Spectroscopy (opens in a new tab)

  16. Geometric algorithms for component analysis with a view to gene expression data analysis

    … the realm of optimization on matrix manifolds. Algorithms for component analysis are subsequently derived that take advantage of the geometrical structure of the problem.When formalizing component analysis into an optimization framework, three main classes of problems are encountered, for which …

    liege Repository record for Geometric algorithms for component analysis with a view to gene expression data analysis (opens in a new tab) Download PDF for Geometric algorithms for component analysis with a view to gene expression data analysis (opens in a new tab)

  17. Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems

    … real-world applications can often be modeled by geometric objects such as points, lines, and polygons. The goal of this dissertation research is to design efficient algorithms for such geometric problems and provide guarantees on their performance via rigorous theoretical analysis. Three related …

    umn Repository record for Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems (opens in a new tab)

  18. Guarantees concerning geometric objects with imprecise points

    Traditional geometric algorithms are often presented as if input imprecision does not exist, even though it is often unavoidable. We argue that in some cases, it may be desirable for geometric algorithms to treat this imprecision as an explicit component of the input, and to reflect this …

    ubc Repository record for Guarantees concerning geometric objects with imprecise points (opens in a new tab) Download PDF for Guarantees concerning geometric objects with imprecise points (opens in a new tab)

Page 1 of 4