Log in

Relevant bibliographies by topics / Visibility graph / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Visibility graph.

Dissertations / Theses on the topic 'Visibility graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 34 dissertations / theses for your research on the topic 'Visibility graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Dey, Sanjoy. "Structural properties of visibility and weak visibility graphs." Virtual Press, 1997. http://liblink.bsu.edu/uhtbin/catkey/1048394.

Full text

Abstract:

Given a finite set S of n nonintersecting line segments with no three end points collinear, the segment end point visibility graph is defined as the graph whose vertices are the end points of the line segments in S and two vertices are adjacent if the straight line segment joining two end points does not intersect any element of S, or if they are end points of the same segment. Segment end point visibility graphs have a wide variety of applications in VLSI circuit design, study of art gallery problems, and other areas of computational geometry. This thesis contains a survey of the important re

APA, Harvard, Vancouver, ISO, and other styles

2

Jackson, LillAnne Elaine, and University of Lethbridge Faculty of Arts and Science. "Polygon reconstruction from visibility information." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 1996, 1996. http://hdl.handle.net/10133/41.

Full text

Abstract:

Reconstruction results attempt to rebuild polygons from visibility information. Reconstruction of a general polygon from its visibility graph is still open and only known to be in PSPACE; thus additional information, such as the ordering of the edges around nodes that corresponds to the order of the visibilities around vertices is frequently added. The first section of this thesis extracts, in o(E) time, the Hamiltonian cycle that corresponds to the boundary of the polygon from the polygon's ordered visibility graph. Also, it converts an unordered visibility graph and Hamiltonian cycle to the

APA, Harvard, Vancouver, ISO, and other styles

3

Sumi, Gregory. "On the visibility graph of disjoint and congruent discs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ37984.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Alanazi, Zeyad M. "A study and implementation of some visibility graph algorithms." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/917045.

Full text

Abstract:

In recent years extensive research has been done on visibility graphs. In this thesis, we study some of the visibility graph algorithms, and implement these algorithms in the graph editor - GraphPerfect - which is a part of a project headed by Dr. Jay S. Bagga of the Department of computer science at Ball State University. One of the goals of this project is to design and build a software tool to learn and work with graphs and graph algorithms.In this thesis, some properties of visibility graphs are studied in detail and implementation of some graph algorithms is given.<br>Department of Comput

APA, Harvard, Vancouver, ISO, and other styles

5

Farrag, Lamis M. "Applications of graph partitioning algorithms to terrain visibility and shortest path problems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ32386.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Diamantopoulos, Anastasios. "A reduced visibility graph approach for motion planning of autonomously guided vehicles." Thesis, University of South Wales, 2001. https://pure.southwales.ac.uk/en/studentthesis/a-reduced-visibility-graph-approach-for-motion-planning-of-autonomously-guided-vehicles(3f368020-0a83-42e5-ba83-b4a4a6257bc2).html.

Full text

Abstract:

This thesis is concerned with the robots' motion planning problem. In particular it is focused on the path planning and motion planning for Autonomously Guided Vehicles (AGVs) in well-structured, two-dimensional static and dynamic environments. Two algorithms are proposed for solving the aforementioned problems. The first algorithm establishes the shortest collision-semi-free path for an AGV from its start point to its goal point, in a two-dimensional static environment populated by simple polygonal obstacles. This algorithm constructs and searches a reduced visibility graph, within the AGV's

APA, Harvard, Vancouver, ISO, and other styles

7

Heinsohn, Niklas [Verfasser], and Michael [Akademischer Betreuer] Kaufmann. "Ply and Bar Visibility - Some Advanced Concepts in Graph Drawing / Niklas Heinsohn ; Betreuer: Michael Kaufmann." Tübingen : Universitätsbibliothek Tübingen, 2020. http://d-nb.info/1210484250/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wooden, David T. "Graph-based Path Planning for Mobile Robots." Diss., Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-11092006-180958/.

Full text

Abstract:

Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2007.<br>Magnus Egerstedt, Committee Chair ; Patricio Vela, Committee Member ; Ayanna Howard, Committee Member ; Tucker Balch, Committee Member ; Wayne Book, Committee Member.

APA, Harvard, Vancouver, ISO, and other styles

9

Lombardi, Alessandro. "Multiple time series forecasting with Graph Neural Networks." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24729/.

Full text

Abstract:

Time series forecasting aims to predict future values to support organizations making strategic decisions. This problem has been studied for decades due to its relevance in almost all industries and areas, ranging from financial data to product demand. Recently, modern solutions based on deep learning have gained popularity among academia and industry, mainly due to the necessity to automatize the forecasting of multiple time series and exploit external explanatory variables. Considering the recent successes of Graph Neural Networks (GNNs) in modelling graph data, this study extends previous w

APA, Harvard, Vancouver, ISO, and other styles

10

Chelly, Magda Lilia. "Propagation d'une position dans les réseaux connectés." Phd thesis, Institut National des Télécommunications, 2011. http://tel.archives-ouvertes.fr/tel-00843587.

Full text

Abstract:

Les systèmes de positionnement ont connu un progrès indéniable. Actuellement, la précision atteint quelques centimètres sous certaines conditions : espace ouvert, ciel dégagé, technique très spécifique, etc. Néanmoins, le problème du positionnement dans un environnement intérieur demeure persistant : les trajets multiples qui compliquent les modèles de propagation, l'atténuation, etc. Différents systèmes ont vu le jour, utilisant des technologies telles que l'UWB, le WiFi ou l'Infrarouge. Ces systèmes apportent des résultats de positionnement intéressants, atteignant l'ordre du mètre. Cette pr

APA, Harvard, Vancouver, ISO, and other styles

11

Ben, salah Imeen. "Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis." Thesis, Normandie, 2019. http://www.theses.fr/2019NORMR070/document.

Full text

Abstract:

Les caméras sont devenues de plus en plus communes dans les véhicules, les smartphones et les systèmes d'aide à la conduite ADAS (Advanced Driver Assistance Systèmes). Les domaines d'application de ces caméras dans le monde des systèmes intelligents de transport deviennent de plus en plus variés : la détection des piétons, les avertissements de franchissement de ligne, la navigation... La navigation basée sur la vision a atteint une certaine maturité durant ces dernières années grâce à l'utilisation de technologies avancées. Les systèmes de navigation basée sur la vision ont le considérable av

APA, Harvard, Vancouver, ISO, and other styles

12

Techakittiroj, Kittiphan. "Visibility graphs and motion planning." Virtual Press, 1995. http://liblink.bsu.edu/uhtbin/catkey/935947.

Full text

Abstract:

Motion planning in the presence of obstacles deals with finding efficient paths from source to target which avoid hitting any of the obstacles. Applications include motion planning in robotics and designing efficient routing systems.Theoretical concepts from graph theory, topology, and computational geometry form the basis for some of the algorithms used in motion planning. The visibility graph is a standard model used in the study of motion planning.This thesis is a report of the research project undertaken to study visibility graphs and their applications to motion planning for certain geome

APA, Harvard, Vancouver, ISO, and other styles

13

Saeedi, Bidokhti Noushin. "On fully characterizing terrain visibility graphs." Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/41902.

Full text

Abstract:

A terrain is an x-monotone polygonal line in the xy-plane. Two vertices of a terrain are mutually visible if and only if they are adjacent or the line segment that connects them lies above the terrain (except at its endpoints). A graph whose vertices represent terrain vertices and whose edges represent mutually visible 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 visibilit

APA, Harvard, Vancouver, ISO, and other styles

14

Moninec, Michal. "Plánování trasy pro autonomní robotickou sekačku." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-442828.

Full text

Abstract:

This diploma thesis is covering the coverage path planning problem for autonomous robotic lawn mower in an area, which is fully defined before and is not changing. It contains a review of the currently used methods and an implementation of a software with a graphic user interface, which is capable of generating optimalized path.

APA, Harvard, Vancouver, ISO, and other styles

15

Haumont, Dominique. "Calcul et représentation de l'information de visibilité pour l'exploration interactive de scènes tridimensionnelles." Doctoral thesis, Universite Libre de Bruxelles, 2006. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210880.

Full text

Abstract:

La synthèse d'images, qui consiste à développer des algorithmes pour générer des images à l'aide d'un ordinateur, est devenue incontournable dans de nombreuses disciplines. <p><p>Les méthodes d'affichage interactives permettent à l'utilisateur d'explorer des environnements virtuels en réalisant l'affichage des images à une cadence suffisamment élevée pour donner une impression de continuité et d'immersion. Malgré les progrès réalisés par le matériel, de nouveaux besoins supplantent toujours les capacités de traitement, et des techniques d'accélération sont nécessaires pour parvenir à maintenir

APA, Harvard, Vancouver, ISO, and other styles

16

Chelly, Magda Lilia. "Propagation d'une position dans les réseaux connectés." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2011. http://www.theses.fr/2011TELE0018.

Full text

Abstract:

Les systèmes de positionnement ont connu un progrès indéniable. Actuellement, la précision atteint quelques centimètres sous certaines conditions : espace ouvert, ciel dégagé, technique très spécifique, etc. Néanmoins, le problème du positionnement dans un environnement intérieur demeure persistant : les trajets multiples qui compliquent les modèles de propagation, l'atténuation, etc. Différents systèmes ont vu le jour, utilisant des technologies telles que l'UWB, le WiFi ou l'Infrarouge. Ces systèmes apportent des résultats de positionnement intéressants, atteignant l'ordre du mètre. Cette pr

APA, Harvard, Vancouver, ISO, and other styles

17

Wismath, Stephen Kenneth. "Bar-representable visibility graphs and a related network flow problem." Thesis, University of British Columbia, 1989. http://hdl.handle.net/2429/29320.

Full text

Abstract:

A bar layout is a set of vertically oriented non-intersecting 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 bar-representable graphs: those graphs which are the visibility graphs of some bar layout. A polynomial time algorithm for determining if a given graph is bar-representable, and the subsequent construction of an associated layout are provided. Weighted

APA, Harvard, Vancouver, ISO, and other styles

18

Luo, Xueyi. "A tool for computer verification of properties of certain classes of visibility graphs." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/897510.

Full text

Abstract:

Segment endpoint visibility graph is a representation scheme for art gallery problems, guard problems, and other shortest path or shortest circuit problems. In the research of visibility graphs, drawing graphs is a time-consuming task. VGE (Visibility Graphs Editor) is developed for visibility graphs reseacheres to create and modify graphs interactively in X-window environment. Appropriate graphics user interface allows the researcher to edit a graph, save and open a file, and make a hard copy of a graph. VGE is developed in C under X-window environment and using EZD[3] graphics tool. The thes

APA, Harvard, Vancouver, ISO, and other styles

19

Angelier, Pierre. "Algorithmique des graphes de visibilité." Paris 7, 2002. http://www.theses.fr/2002PA077007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Ferreira, Thomas Ignatius. "Path planning for an unmanned terrestrial vehicle in an obstacle ridden environment." Thesis, Stellenbosch : University of Stellenbosch, 2009. http://hdl.handle.net/10019.1/1775.

Full text

Abstract:

Thesis (MEng (Electrical and Electronic Engineering))--University of Stellenbosch, 2009.<br>This thesis relates to the successful development of an unmanned terrestrial vehicle (UTV) capable of operating in an obstacle ridden environment. The primary focus of the project is on the specific path planning algorithms. It is shown that specific methods of populating the obstacle-free space can be combined with methods of extracting the shortest path from these popula- tions. Through use of such combinations the successful generation of optimal collision-free paths is demonstrated. Previousl

APA, Harvard, Vancouver, ISO, and other styles

21

Aljohani, Aisha Obaidallah. "DISTRIBUTED ROBOT COORDINATION HANDLING OBSTRUCTIONS AND FAULTS." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1511891411777291.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Franke, Jasper Gideon. "Networks of the late Quaternary." Doctoral thesis, Humboldt-Universität zu Berlin, 2019. http://dx.doi.org/10.18452/19994.

Full text

Abstract:

In den letzten Jahren erfreuen sich komplexe Netzwerke einer zunehmenden Beliebtheit, um Zusammenhänge und Strukturen in hoch-dimensionalen Datensätzen zu analysieren. Im Unterschied zu vielen anderen Forschungsgebieten wurden sie jedoch selten auf Paläoklima-Daten angewandt, obwohl die steigende Anzahl an veröffentlichen Zeitreihen die Nutzung effizienter Methoden multivariater Analyse ermöglicht. Die Resultate der wenigen Studien, in denen Netzwerkmethoden und Paläoklima-Daten kombiniert wurden, sind außerdem geprägt von niedriger Robustheit und hohen Unsicherheiten. Dies steht im Zusammenha

APA, Harvard, Vancouver, ISO, and other styles

23

Melo, Dirceu de Freitas Piedade. "Estudo de padrões em sinais musicais sob a perspectiva dos grafos de visibilidade." Faculdade de Educação, 2017. http://repositorio.ufba.br/ri/handle/ri/25713.

Full text

Abstract:

Submitted by Dirceu Melo (dirceumelo@ymail.com) on 2018-04-05T09:57:27Z No. of bitstreams: 1 TESE_DIRCEU_MELO_ABNT.pdf: 9074956 bytes, checksum: ab3e41a80f3202028098ae8591fc5ba4 (MD5)<br>Approved for entry into archive by Maria Auxiliadora da Silva Lopes (silopes@ufba.br) on 2018-04-10T13:58:44Z (GMT) No. of bitstreams: 1 TESE_DIRCEU_MELO_ABNT.pdf: 9074956 bytes, checksum: ab3e41a80f3202028098ae8591fc5ba4 (MD5)<br>Made available in DSpace on 2018-04-10T13:58:44Z (GMT). No. of bitstreams: 1 TESE_DIRCEU_MELO_ABNT.pdf: 9074956 bytes, checksum: ab3e41a80f3202028098ae8591fc5ba4 (MD5)<br>O advento d

APA, Harvard, Vancouver, ISO, and other styles

24

Tseng, Huan-Hsuan, and 曾煥絢. "Bar visibility number of oriented graph." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/05119132379958439131.

Full text

Abstract:

碩士<br>國立政治大學<br>應用數學系<br>87<br>Chang stuidied the bar visibility representations and defined bar visibility number.We defined analogously the bar visibility representation and the bar c isibility number of a directed graph D.First we show that the bar visibility n umber, denoted by b(D) if D is an oriented graph.And we show that b(D)=1 for t he oriented planar graphs in which all outgoing(incoming) edges of any vertex v of D appear consecutively around v.

APA, Harvard, Vancouver, ISO, and other styles

25

Lin, Shiou-Yi, and 林修懿. "No 4-Connected Planar Graph Could Be a Visibility Graph." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/78559515784860923469.

Full text

Abstract:

碩士<br>國立交通大學<br>應用數學研究所<br>81<br>The recognition problem for visibility graphs is, given a graph, to determine whether this graph is the visibility graph of a simple polygon. It is not known whether this problem could be solved in polynomial time. A necessary condition for a graph to be a visibility graph is the existence of at least one Hamiltonian cycle, corresponding to the boundary of the polygon. Tutte proved that every 4-connected planar graph has a Hamiltonian cycle. However, in this

APA, Harvard, Vancouver, ISO, and other styles

26

Chen, Hsin-Yi, and 陳欣毅. "Finding the Visibility Representation of Plane Graph by DFS." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/40173564112773354108.

Full text

Abstract:

碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>Let G be an n-node planar graph. In a visibility representation of G, each node of G is represented by a horizontal segment such that the segments representing any two adjacent nodes of G are vertically visible to each other. In this thesis, we design a heuristic algorithm to construction visibility representation of plane graphs. First we find a spanning tree by using DFS on a plane graph G, then modify the spanning tree, in order to find the st-numbering and st-orientation of the spanning tree. Finally we use the st-numbering and st-orientation to construct

APA, Harvard, Vancouver, ISO, and other styles

27

Huang, Dai-Heng, and 黃岱珩. "Studies on irreversible process in some non-linear dynamical systems using the Horizontal Visibility Graph approach." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/7669j2.

Full text

Abstract:

碩士<br>國立中央大學<br>物理學系<br>107<br>In recent years, the so-called visibility algorithm has been used in many areas in nonlinear sciences by capturing the correlations of the time series through constructing the corresponding network. Using the directed horizontal visibility algorithm, the time-series can be mapped to a directed network system, and the in-degree and out-degree distributions can be calculated, and it is proposed that the irreversibility of the dynamics can be measured quantitatively by the Kullback-Leibler divergences of these degree distributions. Here, by using the directed hori

APA, Harvard, Vancouver, ISO, and other styles

28

Maron, Oded, and Tomas Lozano-Perez. "Visible Decomposition: Real-Time Path Planning in Large Planar Environments." 1998. http://hdl.handle.net/1721.1/5935.

Full text

Abstract:

We describe a method called Visible Decomposition for computing collision-free paths in real time through a planar environment with a large number of obstacles. This method divides space into local visibility graphs, ensuring that all operations are local. The search time is kept low since the number of regions is proved to be small. We analyze the computational demands of the algorithm and the quality of the paths it produces. In addition, we show test results on a large simulation testbed.

APA, Harvard, Vancouver, ISO, and other styles

29

Wu, Kaiping, and 吳凱平. "Planar Visibility Graphs and Their Properties." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/68648552501538231597.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Sung, Yen-Peng, and 宋彥朋. "Asymptotically Optimal Thickness Bounds of Generalized Bar Visibility Graphs." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/84701459805661359153.

Full text

Abstract:

碩士<br>國立臺灣大學<br>資訊工程學研究所<br>97<br>Given a set of disjoint horizontal line segments (call bars), d(b1, b2) of two bars b1 and b2 is the minimum number of the other bars that the vertical line segments whose endpoints are at b1 and b2 passing through. A graph G is a bar k-visibility graph if G can be represented as a set of disjoint bars such that any two vertices are adjacent in G if and only if d(u, v) ≤ k, where u and v are the associated bars with those vertices. A graph G is a semi bar k-visibility graph if G can be represented as a set of disjoint bars whose left endpoints have the same x-

APA, Harvard, Vancouver, ISO, and other styles

31

FAN, Jia-Hao. "Optimizing the Width of a Visibility Representation of Planar Graphs." 2005. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-0207200514112600.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

FAN, Jia-Hao, and 范家豪. "Optimizing the Width of a Visibility Representation of Planar Graphs." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/70125978240511121915.

Full text

Abstract:

碩士<br>國立臺灣大學<br>電機工程學研究所<br>93<br>In a visibility representation of a planar graph G, each node of G is represented by a horizontal segment and each edge of G is represented by a vertical segment, and incidence between nodes and edges translates to intersection of horizontal and vertical segments. The grid size is at most (2n - 4)*(n - 1) for a graph with n nodes. G must not contain self-loops or multiple edges. We find an algorithm to draw a general planar graph to its visibility representation with width 4n/3 in O(n). More specifically, for an n-node planar graph G, we can obtain its 6 visib

APA, Harvard, Vancouver, ISO, and other styles

33

Hung, Ya-Fei, and 洪雅斐. "Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/77777426186889590325.

Full text

Abstract:

碩士<br>國立臺灣大學<br>資訊網路與多媒體研究所<br>96<br>A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adjacent nodes are vertically visible to each other. If G is a plane graph, i.e., a planar graph equipped with a planar embedding, a visibility representation of G has the additional requirement of reflecting the given planar embedding of G. For the case that G is an n-node four-connected plane graph, we give an O(n)-time algorithm to produce a visibility representation of G with heig

APA, Harvard, Vancouver, ISO, and other styles

34

Hung, Ya-Fei. "Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2507200813544600.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!