Výsledky vyhľadávania - Planar Visibility Graph Networks Algorithm

Planar visibility graph network algorithm for two dimensional timeseries Autor Jie Liu, Qingqing Li

“…In this brief paper, a simple and fast computational method, the Planar Visibility Graph Networks Algorithm was proposed based on the famous Visibility Graph Algorithm, which can fulfill converting…”
Získať plný text

Planar Visibility Graph Network Algorithm For Two Dimensional Timeseries Autor Liu, Jie, Li, Qingqing

“…In this brief paper, a simple and fast computational method, the Planar Visibility Graph Networks Algorithm was proposed based on the famous Visibility Graph Algorithm, which can fulfill converting…”
Získať plný text

Ortho-polygon Visibility Representations of Embedded Graphs Autor Di Giacomo, Emilio, Didimo, Walter, Evans, William S., Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen K.

“…An ortho-polygon visibility representation of an n -vertex embedded graph G (OPVR of G ) is an embedding-preserving drawing of G that maps every vertex…”
Získať plný text

Upward Planar Morphs Autor Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, Roselli, Vincenzo

“…We prove that, given two topologically-equivalent upward planar straight-line drawings of an n -vertex directed graph G , there always exists a morph between them such…”
Získať plný text

The Partial Visibility Representation Extension Problem Autor Chaplick, Steven, Guśpiel, Grzegorz, Gutowski, Grzegorz, Krawczyk, Tomasz, Liotta, Giuseppe

“…For a graph G , a function ψ is called a bar visibility representation of G when for each vertex v ∈ V ( G ) , ψ ( v…”
Získať plný text

Outer 1-Planar Graphs Autor Auer, Christopher, Bachmaier, Christian, Brandenburg, Franz J., Gleißner, Andreas, Hanauer, Kathrin, Neuwirth, Daniel, Reislhuber, Josef

“… We explore o1p graphs. Our first main result is a linear-time algorithm that takes a graph as input and returns a positive or a negative witness for o1p . If a graph…”
Získať plný text

Guarding Polyominoes Under k-Hop Visibility Autor Filtser, Omrit, Krohn, Erik, Nilsson, Bengt J., Rieck, Christian, Schmidt, Christiane

“…We study the Art Gallery Problem under k -hop visibility in polyominoes. In this visibility model, two unit squares of a polyomino can see each other if and…”
Získať plný text

Advanced Technologies for Position and Navigation under GNSS Signal Challenging or Denied Environments

“…Currently, with the popularity of smart devices, assured Position Navigation and Time (PNT) is critical for these devices and some fundamental infrastructures,…”
Získať plný text

Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs Autor Biedl, Therese, Liotta, Giuseppe, Montecchiani, Fabrizio

“…A (weak) rectangle visibility representation, or simply an RVR, of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line…”
Získať plný text

Optimal uniformly monotone partitioning of polygons with holes Autor Wei, Xiangzhi, Joneja, Ajay, Mount, David M.

“…). Our algorithm produces a compressed representation of the subdivision of size O(n), from which it is possible to extract either the entire decomposition or just the boundary of any desired component, in time proportional to the output size…”
Získať plný text

Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs Autor Cohen, Robert F., Di Battista, Giuseppe, Tamassia, Roberto, Tollis, Ioannis G.

“…$-digraphs and planar graphs. Our algorithms adopt a variety of representations (e.g., straight line, polyline, visibility…”
Získať plný text

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time Autor Eppstein, David

“…We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations…”
Získať plný text

Graph algorithms and applications I Autor Tamassia, Roberto, Tollis, Ioannis G

“…This book contains volumes 1-3 of the Journal of Graph Algorithms and Applications (JGAA…”
Získať plný text

Drawing Plane Graphs via Graph Orientations Autor Wang, Jiun-Jie

“… In this thesis, we discuss three well-known graph representations, namely, rectangular layout, visibility representation and greedy drawing…”
Získať plný text

Determining bar-representability for ordered weighted graphs Autor Kirkpatrick, David G., Wismath, Stephen K.

“… 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…”
Získať plný text

Geometric Path-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls Autor Masoudi, Nafiseh

“… Finding the shortest route in a planar (2D) or spatial (3D) environment has a variety of applications such as robot motion planning, navigating autonomous vehicles…”
Získať plný text

Geometric-Based Optimization Algorithms for Cable Routing and Branching in Cluttered Environments Autor Masoudi, Nafiseh

“…The need for designing lighter and more compact systems often leaves limited space for planning routes for the connectors that enable interactions among the…”
Získať plný text

Some Algorithms for Computing Monotone Paths With Engineering Applications Autor Wei, Xiangzhi

“… We call this the MUMC problem. In this thesis we provide an improved algorithm. We show that given a polygon with n vertices and h holes and a scan direction, the MUMC problem can be solved in time O(n log n + h log3 h…”
Získať plný text

Modelling financial markets using methods from network theory Autor Birch, Jenna

“…; assets graphs and planar maximally filtered graphs. A series of each of these network types is created for the same dataset of time series' of DAX 30 stocks…”
Získať plný text

Automatic extrinsic calibration of multiple laser range sensors with little overlap Autor Rowekamper, Jorg, Ruhnke, Michael, Steder, Bastian, Burgard, Wolfram, Tipaldi, Gian Diego

“… scanners. In this paper, we present a novel approach to calibrate a network of multiple planar laser range finders scanning horizontally…”
Získať plný text