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 20 for “"Visibility graphs"”.

  1. On fully characterizing terrain visibility graphs

    … pairs of terrain vertices is called a terrain visibility graph. Understanding the graph theoretic properties of all terrain visibility graphs may help us understand the combinatorial structure of these geometric objects and help to address problems related to geometric visibility. The …

    ubc Repository record for On fully characterizing terrain visibility graphs (opens in a new tab) Download PDF for On fully characterizing terrain visibility graphs (opens in a new tab)

  2. Bar-representable visibility graphs and a related network flow problem

    … line segments in the plane called bars. The visibility graph associated with a layout is defined as the graph whose vertices correspond to the bars and whose edges represent the horizontal visibilities between pairs of bars. This dissertation is concerned with the characterization of …

    ubc Repository record for Bar-representable visibility graphs and a related network flow problem (opens in a new tab) Download PDF for Bar-representable visibility graphs and a related network flow problem (opens in a new tab)

  3. Applications of Visibility Graphs for the representation of Time Series

    … problems: we first explore the application of visibility graphs for describing the orbits of a discrete dynamical system that is governed by a fractional version of the logistic equation. We also study how to use this type of graphs to study response time series from the perspective of …

    upv Repository record for Applications of Visibility Graphs for the representation of Time Series (opens in a new tab)

  4. Signed visibility graphs of time series and their application to brain networks

    … introducing signs to the edges that describe the visibility graph. The resulting signed visibility graph contains more information about the properties of time series than standard visibility graphs. We designed a dynamic programming algorithm that creates optimal, non-overlapping and …

    ubc Repository record for Signed visibility graphs of time series and their application to brain networks (opens in a new tab) Download PDF for Signed visibility graphs of time series and their application to brain networks (opens in a new tab)

  5. Variations on Zombies and Survivor in Simple Polygons

    … game of a zombie and a survivor on point visibility graphs of simple polygons. A zombie has one objective: catch a survivor by occupying the vertex occupied by the survivor. On its turn, a zombie can only move on the first edge of a \textit{geodesic} path to the survivor's location. A …

    carleton Repository record for Variations on Zombies and Survivor in Simple Polygons (opens in a new tab)

  6. Searching for Shortest and Safest Paths Along Obstacle Common Tangents

    … the construction of obstacle common tangent visibility graphs. Visibility and intersection testing are based on the orientation of three or more points in the plane, and complex obstacle tangent visibility graphs are constructed using only these orientation relationships. Obstacle common …

    nps Repository record for Searching for Shortest and Safest Paths Along Obstacle Common Tangents (opens in a new tab)

  7. Criticality in dynamical systems through complex networks

    … networks is addressed in two directions: using visibility graphs and intermittent networks. The visibility graph method is used to map time series onto networks. We applied this framework to generate and analyze visibility graphs from time series of the density of infected individuals. The main …

    brazil-ufv Repository record for Criticality in dynamical systems through complex networks (opens in a new tab)

  8. Real-Time Edge Computing for Autonomous Systems

    … a new initialization method combining adaptive visibility graphs and Dijkstra’s algorithm is proposed to improve the exploration, accuracy, and computing efficiency of hybrid path planning for mobile robots. In this approach, segments/links in the full visibility graphs are first removed …

    south-carolina Repository record for Real-Time Edge Computing for Autonomous Systems (opens in a new tab)

  9. Mathematical aspects of coagulation and fragmentation processes

    … and fragmentation processes. We initially use visibility graphs as a tool to analyse the results of kinetic Monte Carlo (kMC) simulations of submonolayer deposition in a one dimensional point island model. We introduce an effcient algorithm for the computation of the visibility graph resulting …

    strathclyde Repository record for Mathematical aspects of coagulation and fragmentation processes (opens in a new tab)

  10. Rectangle Visibility Numbers of Graphs

    … to edges. We say that a graph G has a rectangle visibility representation if we can assign each vertex of G to a unique axis-aligned rectangle in the plane such that two vertices u and v are adjacent if and only if there exists an unobstructed horizontal or vertical channel of finite width …

    rit Repository record for Rectangle Visibility Numbers of Graphs (opens in a new tab)

  11. Planning for Autonomous Operation of Unmanned Surface Vehicles

    … complex marine environments using A* search on visibility graphs defined over quad trees. Finally, we present an A* based path planning algorithm with newly developed admissible heuristics for computing energy efficient paths in environment with significant fluid flows. The effectiveness of the …

    maryland Repository record for Planning for Autonomous Operation of Unmanned Surface Vehicles (opens in a new tab)

  12. The Efficiency Impact Of Gershgorin Circle Theorem For Feature Extraction In Computer Vision And Biomedical Signal Analysis

    … when signals or images are transformed into graphs where they are subsequently represented in the form of matrices, typically as Adjacency or Laplacian matrices. As the number of the samples increases, the dimensionality of these matrices also increases, leading to the "curse of …

    uab Repository record for The Efficiency Impact Of Gershgorin Circle Theorem For Feature Extraction In Computer Vision And Biomedical Signal Analysis (opens in a new tab)

  13. Ενοποιημένο σύστημα ενός ή πολλαπλών ρομπότ για την πλοήγηση και εξερεύνηση σε αστικό περιβάλλον με σκοπό τον εντοπισμό ανθρώπινης ζωής (USAR)

    … from different families, such as RRTs, Visibility Graphs, PRMs etc.. These methods are modified in order to to perform on a constant basis, regardless to the space morphology. Another contribution is in the way the robot chooses its next best target. The targets are exported as the set …

    greece Repository record for Ενοποιημένο σύστημα ενός ή πολλαπλών ρομπότ για την πλοήγηση και εξερεύνηση σε αστικό περιβάλλον με σκοπό τον εντοπισμό ανθρώπινης ζωής (USAR) (opens in a new tab)

  14. Geodesic Problems for Mobile Robots

    … product of the roadmap with itself. We extend visibility graphs to solve the problem. If the roadmap is acyclic, then our algorithm has O(mn2 log n) time complexity, in which m is the number of paths in the roadmap, and n is the number of coordination space vertices. For cyclic roadmaps, our …

    uiuc Repository record for Geodesic Problems for Mobile Robots (opens in a new tab)

  15. Straight Line Movement in Morphing and Pursuit Evasion

    … always win the game when the players move on the visibility graph of a simple polygon. We prove this by showing that the visibility graph of a simple polygon is “dismantlable” (the known class of cop-win graphs). Polygon visibility graphs are also shown to be 2-dismantlable. Two other settings of …

    waterloo Repository record for Straight Line Movement in Morphing and Pursuit Evasion (opens in a new tab)

  16. Routing and Stabbing

    … problem has been studied extensively for general graphs, where efficient routing schemes with polylogarithmic routing tables have turned out to be impossible. Thus, special graph classes are of interest. Let P be an x-monotone orthogonal polygon with n vertices. We call P a simple histogram if its …

    fu-berlin Repository record for Routing and Stabbing (opens in a new tab)

  17. Visibility analyses using 3D urban models generated by low-cost multi-sensor approaches

    The conditions of visibility of a user moving through an outdoor or indoor environment affect his safety. In both environments it is fundamental to guarantee a sufficient visibility in order to avoid possible collisions. In the specific case of urban roads the available sight distance (ASD) is that …

    poli-torino Repository record for Visibility analyses using 3D urban models generated by low-cost multi-sensor approaches (opens in a new tab)

  18. Deterministic byzantine-resilient robot gathering

    … that the gathering task is solvable if this visibility range H is at least the radius of the graph, and not solvable if H is any fixed constant.

    manitoba Repository record for Deterministic byzantine-resilient robot gathering (opens in a new tab)