Log in

Relevant bibliographies by topics / Visibility graph

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Visibility graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 June 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Visibility graph"

1

LIN, YAW-LING, and STEVEN S. SKIENA. "COMPLEXITY ASPECTS OF VISIBILITY GRAPHS." International Journal of Computational Geometry & Applications 05, no. 03 (1995): 289–312. http://dx.doi.org/10.1142/s0218195995000179.

Full text

Abstract:

In this paper, we consider two distinct problems related to complexity aspects of the visibility graphs of simple polygons. Recognizing visibility graphs is a long-standing open problem. It is not even known whether visibility graph recognition is in NP. That visibility graph recognition is in NP would be established if we could demonstrate that any n vertex visibility graph is realized by a polygon which can be drawn on an exponentially-sized grid. This motivates a study of the area requirements for realizing visibility graphs. In this paper, we prove: • Θ(n3) area is necessary and sufficient

APA, Harvard, Vancouver, ISO, and other styles

2

Roy, Bodhayan. "Point Visibility Graph Recognition is NP-Hard." International Journal of Computational Geometry & Applications 26, no. 01 (2016): 1–32. http://dx.doi.org/10.1142/s0218195916500011.

Full text

Abstract:

Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard.

APA, Harvard, Vancouver, ISO, and other styles

3

Du, Congju, and Bin Tang. "Novel Unconventional-Active-Jamming Recognition Method for Wideband Radars Based on Visibility Graphs." Sensors 19, no. 10 (2019): 2344. http://dx.doi.org/10.3390/s19102344.

Full text

Abstract:

Radar unconventional active jamming, including unconventional deceptive jamming and barrage jamming, poses a serious threat to wideband radars. This paper proposes an unconventional-active-jamming recognition method for wideband radar. In this method, the visibility algorithm of converting the radar time series into graphs, called visibility graphs, is first given. Then, the visibility graph of the linear-frequency-modulation (LFM) signal is proved to be a regular graph, and the rationality of extracting features on visibility graphs is theoretically explained. Therefore, four features on visi

APA, Harvard, Vancouver, ISO, and other styles

4

COULLARD, COLLETTE, and ANNA LUBIW. "DISTANCE VISIBILITY GRAPHS." International Journal of Computational Geometry & Applications 02, no. 04 (1992): 349–62. http://dx.doi.org/10.1142/s0218195992000202.

Full text

Abstract:

A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility graph of a simple polygon with the given weights as Euclidean distances?

APA, Harvard, Vancouver, ISO, and other styles

5

NUÑEZ, ANGEL, LUCAS LACASA, EUSEBIO VALERO, JOSE PATRICIO GÓMEZ, and BARTOLO LUQUE. "DETECTING SERIES PERIODICITY WITH HORIZONTAL VISIBILITY GRAPHS." International Journal of Bifurcation and Chaos 22, no. 07 (2012): 1250160. http://dx.doi.org/10.1142/s021812741250160x.

Full text

Abstract:

The horizontal visibility algorithm was recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore such graph theoretical characterization is in principle possible. However, both the mathematical grounding of this promising theory and its applications are in its infancy. Following this line, here we

APA, Harvard, Vancouver, ISO, and other styles

6

Lu, Yi, Zhonghua Gou, Yu Ye, and Qiang Sheng. "Three-dimensional visibility graph analysis and its application." Environment and Planning B: Urban Analytics and City Science 46, no. 5 (2017): 948–62. http://dx.doi.org/10.1177/2399808317739893.

Full text

Abstract:

Graph-based visibility analysis, developed from space syntax and social network theory, embraces mutual visibility between locations in a spatial system. It helps designers and researchers to decode spatial cognition and behavior, but methodological constraints limit its application to two-dimensional floor plans. In this study, we propose a new visibility graph analysis that can be used in three-dimensional built environments, such as multilevel atrium buildings or urban environments with canopies or overpass bridges. Furthermore, we draw a distinction between a generic visibility graph and a

APA, Harvard, Vancouver, ISO, and other styles

7

Bhagavathi, D., H. Gurla, S. Olariu, J. L. Schwing, and J. Zhang. "Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs." VLSI Design 4, no. 1 (1996): 33–40. http://dx.doi.org/10.1155/1996/40175.

Full text

Abstract:

The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ(log n)

APA, Harvard, Vancouver, ISO, and other styles

8

Kant, Goos. "A More Compact Visibility Representation." International Journal of Computational Geometry & Applications 07, no. 03 (1997): 197–210. http://dx.doi.org/10.1142/s0218195997000132.

Full text

Abstract:

In this paper we present a linear time and space algorithm for constructing a visibility representation of a planar graph on an [Formula: see text] grid, thereby improving the previous bound of (2n-5)×(n-1). To this end we build in linear time the 4-block tree of a planar graph, which improves previous time bounds. Moreover, this is the first time that the technique of splitting a graph into its 4-connected components is used successfully in graph drawing

APA, Harvard, Vancouver, ISO, and other styles

9

Bhaduri, Susmita, and Dipak Ghosh. "Azimuthal Anisotropy in High-Energy Nuclear Collision: An Approach Based on Complex Network Analysis." Advances in High Energy Physics 2018 (2018): 1–9. http://dx.doi.org/10.1155/2018/8347408.

Full text

Abstract:

Recently, a complex network based method of visibility graph has been applied to confirm the scale-freeness and presence of fractal properties in the process of multiplicity fluctuation. Analysis of data obtained from experiments on hadron-nucleus and nucleus-nucleus interactions results in values of Power of Scale-Freeness of Visibility Graph (PSVG) parameter extracted from the visibility graphs. Here, the relativistic nucleus-nucleus interaction data have been analysed to detect azimuthal anisotropy by extending the visibility graph method and extracting the average clustering coefficient, o

APA, Harvard, Vancouver, ISO, and other styles

10

Lv, Taizhi, Chunxia Zhao, and Jiancheng Bao. "A Global Path Planning Algorithm Based on Bidirectional SVGA." Journal of Robotics 2017 (2017): 1–11. http://dx.doi.org/10.1155/2017/8796531.

Full text

Abstract:

For path planning algorithms based on visibility graph, constructing a visibility graph is very time-consuming. To reduce the computing time of visibility graph construction, this paper proposes a novel global path planning algorithm, bidirectional SVGA (simultaneous visibility graph construction and path optimization by A⁎). This algorithm does not construct a visibility graph before the path optimization. However it constructs a visibility graph and searches for an optimal path at the same time. At each step, a node with the lowest estimation cost is selected to be expanded. According to the

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Visibility graph"

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

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

10

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

Books on the topic "Visibility graph"

1

Everett, Hazel Jane Margaret *. Visibility graph recognition. 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jones, Charles Harold. Triangle intersection graphs and visibility graphs. 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bianconi, Ginestra. Synchronization, Non-linear Dynamics and Control. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198753919.003.0015.

Full text

Abstract:

This chapter is entirely devoted to characterizing non-linear dynamics on multilayer networks. Special attention is given to recent results on the stability of synchronization that extend the Master Stability Function approach to the multilayer networks scenario. Discontinous synchronization transitions on multiplex networks recently reported in the literature are also discussed, and their application discussed in the context of brain networks. This chapter also presents an overview of the major results regarding pattern formation in multilayer networks, and the proposed characterization of mu

APA, Harvard, Vancouver, ISO, and other styles

4

Joseph, O'Rourke. Art gallery theorems and algorithms. Oxford University Press, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Visibility graph"

1

Bose, Prosenjit, Alice Dean, Joan Hutchinson, and Thomas Shermer. "On rectangle visibility graphs." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Babilon, Robert, Helena Nyklová, Ondřej Pangrác, and Jan Vondrák. "Visibility Representations of Complete Graphs." In Graph Drawing. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46648-7_34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Felsner, Stefan, and Mareike Massow. "Thickness of Bar 1-Visibility Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-70904-6_32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dean, Alice M., and Joan P. Hutchinson. "Rectangle-visibility representations of bipartite graphs." In Graph Drawing. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-58950-3_367.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hutchinson, Joan P. "On Polar Visibility Representations of Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45848-4_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hutchinson, Joan P. "On Polar Visibility Representations of Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44541-2_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Cobos, F. J., J. C. Dana, F. Hurtado, A. Márquez, and F. Mateos. "On a visibility representation of graphs." In Graph Drawing. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0021799.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Štola, Jan. "3D Visibility Representations by Regular Polygons." In Graph Drawing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_31.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Štola, Jan. "3D Visibility Representations of Complete Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24595-7_21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fößmeier, Ulrich, Goos Kant, and Michael Kaufmann. "2-Visibility drawings of planar graphs." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Visibility graph"

1

Zeng, Ming, Wenxin Ma, Qinghao Meng, Biao Sun, Zhanxie Wu, and Jing Lu. "Noise resistance ability analysis of the visibility graph and the limited penetrable visibility graph." In 2016 12th World Congress on Intelligent Control and Automation (WCICA). IEEE, 2016. http://dx.doi.org/10.1109/wcica.2016.7578754.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dehghani, Gholamreza, and Hossein Morady. "An Algorithm for Visibility Graph Recognition on Planar Graphs." In 2009 International Conference on Future Computer and Communication (ICFCC). IEEE, 2009. http://dx.doi.org/10.1109/icfcc.2009.97.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ji, Hongda, Tian Xu, Wei Wu, and Jun Wang. "Visibility graph analysis on EEG signal." In 2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI). IEEE, 2016. http://dx.doi.org/10.1109/cisp-bmei.2016.7852963.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kulbiej, Eric. "Autonomous Vessels' Pathfinding Using Visibility Graph." In 2018 Baltic Geodetic Congress (BGC Geomatics). IEEE, 2018. http://dx.doi.org/10.1109/bgc-geomatics.2018.00026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Pocchiola, Michel, and Gert Vegter. "Computing the visibility graph via pseudo-triangulations." In the eleventh annual symposium. ACM Press, 1995. http://dx.doi.org/10.1145/220279.220306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gao, Zhongke, and Lingchao Ji. "Visibility graph analysis of fluid flow signals." In 2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI). IEEE, 2012. http://dx.doi.org/10.1109/icaci.2012.6463119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sengupta, Anwesha, Aurobinda Routray, and Sibsambhu Kar. "Complex brain networks using Visibility Graph synchronization." In 2013 Annual IEEE India Conference (INDICON). IEEE, 2013. http://dx.doi.org/10.1109/indcon.2013.6726126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

"A Visibility Graph based Shape Decomposition Technique." In International Conference on Computer Vision Theory and Applications. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004692005150522.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lee, Chi-Wei, Benson P. C. Liu, and Chyi-Gang Kuo. "A Computational Model Refinement for Visibility Graph Analysis." In 2020 IEEE 2nd Eurasia Conference on Biomedical Engineering, Healthcare and Sustainability (ECBIOS). IEEE, 2020. http://dx.doi.org/10.1109/ecbios50299.2020.9203610.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zhu, ShengLi, and Lu Gan. "Specific emitter identification based on horizontal visibility graph." In 2017 3rd IEEE International Conference on Computer and Communications (ICCC). IEEE, 2017. http://dx.doi.org/10.1109/compcomm.2017.8322758.

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!