Log in

Relevant bibliographies by topics / Visibility graph / Journal articles

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

Journal articles 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 50 journal articles 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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

Oh, Shunhao, and Hon Wai Leong. "Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths." Proceedings of the International Symposium on Combinatorial Search 8, no. 1 (2021): 64–72. http://dx.doi.org/10.1609/socs.v8i1.18427.

Full text

Abstract:

In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of pre-processing. However, Visibility Graphs are known to perform poorly in terms of running time, especially on large, complex maps. In this paper, we introduce two improvements over the Visibility Graph Algorithm to compute optimal paths. Sparse Visibility Graphs (SVGs) are constructed by pruning unn

APA, Harvard, Vancouver, ISO, and other styles

6

Muñoz, Víctor, and N. Elizabeth Garcés. "Analysis of pulsating variable stars using the visibility graph algorithm." PLOS ONE 16, no. 11 (2021): e0259735. http://dx.doi.org/10.1371/journal.pone.0259735.

Full text

Abstract:

We study the light curves of pulsating variable stars using a complex network approach to build visibility graphs. We consider various types of variables stars (e.g., Cepheids, δ Scuti, RR Lyrae), build two types of graphs (the normal visibility graph (VG) and the horizontal visibility graph (HVG)), and calculate various metrics for the resulting networks. We find that all networks have a power-law degree distribution for the VG and an exponential distribution for the HVG, suggesting that it is a universal feature, regardless of the pulsation features. Metrics such as the average degree, the c

APA, Harvard, Vancouver, ISO, and other styles

7

Ren, Weikai, and Zhijun Jin. "Phase space visibility graph." Chaos, Solitons & Fractals 176 (November 2023): 114170. http://dx.doi.org/10.1016/j.chaos.2023.114170.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

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

10

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

11

Ali, Musrrat, Sanoj Kumar, Rahul Pal, Manoj K. Singh, and Deepika Saini. "Graph- and Machine-Learning-Based Texture Classification." Electronics 12, no. 22 (2023): 4626. http://dx.doi.org/10.3390/electronics12224626.

Full text

Abstract:

The analysis of textures is an important task in image processing and computer vision because it provides significant data for image retrieval, synthesis, segmentation, and classification. Automatic texture recognition is difficult, however, and necessitates advanced computational techniques due to the complexity and diversity of natural textures. This paper presents a method for classifying textures using graphs; specifically, natural and horizontal visibility graphs. The related image natural visibility graph (INVG) and image horizontal visibility graph (IHVG) are used to obtain features for

APA, Harvard, Vancouver, ISO, and other styles

12

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

13

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

14

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

15

Sithole, G. "INDOOR SPACE ROUTING GRAPHS: VISIBILITY, ENCODING, ENCRYPTION AND ATTENUATION." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-4 (September 19, 2018): 579–85. http://dx.doi.org/10.5194/isprs-archives-xlii-4-579-2018.

Full text

Abstract:

<p><strong>Abstract.</strong> The conventional approach to path planning for indoor navigation is to infer routes from a subdivided floor map of the indoor space. The floor map describes the spatial geometry of the space. Contained in this floor map are logical units called subspaces. For the purpose of path planning the possible routes between the subspaces have to be modelled. Typical these models employing a graph structures, or skeletons, in which the interconnected subspaces (e.g., rooms, corridors, etc.) are represented as linked nodes, i.e. a graph.</p><p>T

APA, Harvard, Vancouver, ISO, and other styles

16

BREMNER, DAVID, and THOMAS SHERMER. "POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER." International Journal of Computational Geometry & Applications 10, no. 01 (2000): 55–71. http://dx.doi.org/10.1142/s0218195900000048.

Full text

Abstract:

A visibility relation can be viewed as a graph: the uncountable graph of a visibility relationship between points in a polygon P is called the point visibility graph (PVG) of P. In this paper we explore the use of perfect graphs to characterize tractable subproblems of visibility problems. Our main result is a characterization of which polygons are guaranteed to have weakly triangulated PVGs, under a generalized notion of visibility called [Formula: see text]-visibility. Let [Formula: see text] denote a set of line orientations. A connected point set P is called [Formula: see text]-convex if t

APA, Harvard, Vancouver, ISO, and other styles

17

WISMATH, S. K. "POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION." International Journal of Computational Geometry & Applications 10, no. 02 (2000): 189–200. http://dx.doi.org/10.1142/s0218195900000115.

Full text

Abstract:

In general, visibility reconstruction problems involve determining a set of objects in the plane that exhibit a specified set of visibility constraints. In this paper, an algorithm is presented for reconstructing a set of parallel line segments from specified visibility information contained in an extended endpoint visibility graph. The algorithm runs in polynomial time and relies on simple vector arithmetic to generate a system of linear inequalities. A related problem, solvable with the same technique, is the point reconstruction problem, in which the cyclic ordering and the x-coordinates of

APA, Harvard, Vancouver, ISO, and other styles

18

Akgüller, Ömer, Mehmet Ali Balcı, Larissa M. Batrancea, and Lucian Gaban. "Path-Based Visibility Graph Kernel and Application for the Borsa Istanbul Stock Network." Mathematics 11, no. 6 (2023): 1528. http://dx.doi.org/10.3390/math11061528.

Full text

Abstract:

Using networks to analyze time series has become increasingly popular in recent years. Univariate and multivariate time series can be mapped to networks in order to examine both local and global behaviors. Visibility graph-based time series analysis is proposed herein; in this approach, individual time series are mapped to visibility graphs that characterize relevant states. Companies listed on the emerging market index Borsa Istanbul 100 (BIST 100) had their market visibility graphs collected. To further account for the local extreme values of the underlying time series, we constructed a nove

APA, Harvard, Vancouver, ISO, and other styles

19

Dong, Keqiang, Haowei Che, and Zhi Zou. "Multiscale Horizontal Visibility Graph Analysis of Higher-Order Moments for Estimating Statistical Dependency." Entropy 21, no. 10 (2019): 1008. http://dx.doi.org/10.3390/e21101008.

Full text

Abstract:

The horizontal visibility graph is not only a powerful tool for the analysis of complex systems, but also a promising way to analyze time series. In this paper, we present an approach to measure the nonlinear interactions between a non-stationary time series based on the horizontal visibility graph. We describe how a horizontal visibility graph may be calculated based on second-order and third-order statistical moments. We compare the new methods with the first-order measure, and then give examples including stock markets and aero-engine performance parameters. These analyses suggest that meas

APA, Harvard, Vancouver, ISO, and other styles

20

Babič, Matej, Ninoslav Marina, Andrej Mrvar, Kumar Dookhitram, and Michele Calì. "A New Method for Biostatistical miRNA Pattern Recognition with Topological Properties of Visibility Graphs in 3D Space." Journal of Healthcare Engineering 2019 (June 11, 2019): 1–9. http://dx.doi.org/10.1155/2019/4373760.

Full text

Abstract:

Visibility is a very important topic in computer graphics and especially in calculations of global illumination. Visibility determination, the process of deciding which surface can be seen from a certain point, has also problematic applications in biomedical engineering. The problem of visibility computation with mathematical tools can be presented as a visibility network. Instead of utilizing a 2D visibility network or graphs whose construction is well known, in this paper, a new method for the construction of 3D visibility graphs will be proposed. Drawing graphs as nodes connected by links i

APA, Harvard, Vancouver, ISO, and other styles

21

Alifiano Rezka Adi and Muhammad Rizqi. "OPTIMALISASI VISIBILITAS MENGGUNAKAN SPACE SYNTAX: STUDI KASUS GEDUNG GALERI NUSANTARA SEMARANG." Nature: National Academic Journal of Architecture 10, no. 2 (2023): 166–80. http://dx.doi.org/10.24252/nature.v10i2a5.

Full text

Abstract:

Abstrak_ Dalam pameran seni dan arsitektur, gedung galeri menjadi ruang padat pengunjung dimana kualitas ruang interior dapat berpengaruh terhadap kenyamanan visual pengunjung dalam menikmati karya. Kepadatan yang terlalu tinggi disertai tata interior yang tidak terstruktur berpotensi menimbulkan rendahnya kualitas visibilitas di dalam ruang pameran. Gedung Galeri Nusantara dijadikan menjadi studi kasus dalam penelitian ini dengan berfokus pada optimalisasi visibilitas menggunakan pendekatan space syntax dengan bantuan aplikasi Depthmap. Analisis dilakukan berdasarkan peta VGA (Visibility Grap

APA, Harvard, Vancouver, ISO, and other styles

22

Stephen, Mutua, Changgui Gu, and Huijie Yang. "Visibility Graph Based Time Series Analysis." PLOS ONE 10, no. 11 (2015): e0143015. http://dx.doi.org/10.1371/journal.pone.0143015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

PUPPO, ENRICO, and PAOLA MARZANO. "Discrete visibility problems and graph algorithms." International Journal of Geographical Information Science 11, no. 2 (1997): 139–61. http://dx.doi.org/10.1080/136588197242437.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Chen, Shiyu, Yong Hu, Sankaran Mahadevan, and Yong Deng. "A visibility graph averaging aggregation operator." Physica A: Statistical Mechanics and its Applications 403 (June 2014): 1–12. http://dx.doi.org/10.1016/j.physa.2014.02.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Ren, Weikai, and Ningde Jin. "Sequential limited penetrable visibility-graph motifs." Nonlinear Dynamics 99, no. 3 (2020): 2399–408. http://dx.doi.org/10.1007/s11071-019-05439-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Carmi, Paz, Eran Friedman, and Matthew J. Katz. "Spiderman graph: Visibility in urban regions." Computational Geometry 48, no. 3 (2015): 251–59. http://dx.doi.org/10.1016/j.comgeo.2014.10.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Plantinga, Harry, and Charles R. Dyer. "Visibility, occlusion, and the aspect graph." International Journal of Computer Vision 5, no. 2 (1990): 137–60. http://dx.doi.org/10.1007/bf00054919.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Boomari, Hossein, Mojtaba Ostovari, and Alireza Zarei. "Recognizing Visibility Graphs of Triangulated Irregular Networks." Fundamenta Informaticae 179, no. 4 (2021): 345–60. http://dx.doi.org/10.3233/fi-2021-2027.

Full text

Abstract:

A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY-plane is a triangulation. The visibility graph of a TIN is a graph whose vertices correspond to the vertices of the TIN and there is an edge between two vertices if their corresponding vertices on TIN see each other, i.e. the segment that connects these vertices completely lies above the TIN. Computing the visibility graph of a TIN and

APA, Harvard, Vancouver, ISO, and other styles

29

Baz, Mohammed. "TVGeAN: Tensor Visibility Graph-Enhanced Attention Network for Versatile Multivariant Time Series Learning Tasks." Mathematics 12, no. 21 (2024): 3320. http://dx.doi.org/10.3390/math12213320.

Full text

Abstract:

This paper introduces Tensor Visibility Graph-enhanced Attention Networks (TVGeAN), a novel graph autoencoder model specifically designed for MTS learning tasks. The underlying approach of TVGeAN is to combine the power of complex networks in representing time series as graphs with the strengths of Graph Neural Networks (GNNs) in learning from graph data. TVGeAN consists of two new main components: TVG which extend the capabilities of visibility graph algorithms in representing MTSs by converting them into weighted temporal graphs where both the nodes and the edges are tensors. Each node in th

APA, Harvard, Vancouver, ISO, and other styles

30

Ayesha, D. F., Y. M. Ardiani, and B. A. Suryawinata. "Market With Visibility Graph Analysis Method in Palmerah Central Jakarta." IOP Conference Series: Earth and Environmental Science 1169, no. 1 (2023): 012056. http://dx.doi.org/10.1088/1755-1315/1169/1/012056.

Full text

Abstract:

Abstract Visibility is an important element in commercial spaces. However, the importance of visibility in traditional markets–especially in Indonesia–are often overlooked during the design process. One of the markets with this problem is Palmerah Market in Central Jakarta. Palmerah Market is an intriguing topic for architecture research since Palmerah Market has three different functions in one building, such as traditional market, modern supermarket, and auto parts center. Yet, the elements that are supposed to be Palmerah Market’s potential is not operating the way it’s supposed to. This is

APA, Harvard, Vancouver, ISO, and other styles

31

Jiang, K., L. D. Seneviratne, and S. W. E. Earles. "Time-optimal smooth-path motion planning for a mobile robot with kinematic constraints." Robotica 15, no. 5 (1997): 547–53. http://dx.doi.org/10.1017/s0263574797000635.

Full text

Abstract:

This paper presents a novel time-optimal motion planning strategy for a mobile robot with kinematic constraints. The method works in environments in presence of obstacles, without needing to generate the configuration space for the robot. Further, it derives a minimum time first derivative smooth path, as opposed to a minimum distance path which is commonly given by various present solution techniques. The problem is solved in three stages: (i) A reduced visibility graph for a point object is obtained. (ii) The reduced visibility graph is converted into a feasible reduced visibility graph acco

APA, Harvard, Vancouver, ISO, and other styles

32

Popova, Anastasiya Aleksandrovna. "Global route planning for a mobile robot based on graph methods." Vestnik of Astrakhan State Technical University. Series: Management, computer science and informatics 2024, no. 2 (2024): 57–67. http://dx.doi.org/10.24143/2072-9502-2024-2-57-67.

Full text

Abstract:

The problem of global route planning for a mobile robot between two given points in a known area with static obstacles is considered. To solve the problem of constructing a route in an area with a large number of obstacles of complex shape, an integrated approach based on graph theory methods is proposed. It includes the Voronoi diagram, visibility graph and the Dijkstra's algorithm. At the first stage, the study area is represented as a polygonal object, the space outside the object is considered as obstacles. Next, to get a safe distance from obstacles, an internal buffer of the polygonal ob

APA, Harvard, Vancouver, ISO, and other styles

33

Bai, Shiwei, and Min Niu. "The visibility graph of n-bonacci sequence." Chaos, Solitons & Fractals 163 (October 2022): 112500. http://dx.doi.org/10.1016/j.chaos.2022.112500.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Baggio, Rodolfo. "Complex tourism systems: a visibility graph approach." Kybernetes 43, no. 3/4 (2014): 445–61. http://dx.doi.org/10.1108/k-12-2013-0266.

Full text

Abstract:

Purpose – The social responsibility of a tourism destination results from the combined efforts of the single stakeholders. This needs coordination and harmonization that cannot be achieved without a deep understanding of the structural and dynamic characteristics of the destination. A tourism destination is a complex dynamic system and requires specific methods to be analyzed and understood in order to better tailor governance actions for steering it along an evolutionary growth path, respectful of the social responsibility towards the community. Many methodological recommendations exist that

APA, Harvard, Vancouver, ISO, and other styles

35

Hosono, Kiyoshi, Henk Meijer, and David Rappaport. "On the visibility graph of convex translates." Discrete Applied Mathematics 113, no. 2-3 (2001): 195–210. http://dx.doi.org/10.1016/s0166-218x(00)00270-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Liu, Keshi, Tongfeng Weng, Changgui Gu, and Huijie Yang. "Visibility graph analysis of Bitcoin price series." Physica A: Statistical Mechanics and its Applications 538 (January 2020): 122952. http://dx.doi.org/10.1016/j.physa.2019.122952.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Yang, Yue, Jianbo Wang, Huijie Yang, and Jingshi Mang. "Visibility graph approach to exchange rate series." Physica A: Statistical Mechanics and its Applications 388, no. 20 (2009): 4431–37. http://dx.doi.org/10.1016/j.physa.2009.07.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Chang, Yi-Wu, Joan P. Hutchinson, Michael S. Jacobson, Jeno Lehel, and Douglas B. West. "The Bar Visibility Number of a Graph." SIAM Journal on Discrete Mathematics 18, no. 3 (2004): 462–71. http://dx.doi.org/10.1137/s0895480198343455.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

师, 野. "Stock Industry Analysis Based on Visibility Graph." Advances in Applied Mathematics 11, no. 11 (2022): 8008–17. http://dx.doi.org/10.12677/aam.2022.1111848.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Majdi, Hoda, Mahdi Azarnoosh, Majid Ghoshuni, and VahidReza Sabzevari. "Using Visibility Graph to Analyze Brain Connectivity." Neuroscience Journal of Shefaye Khatam 10, no. 2 (2022): 57–67. http://dx.doi.org/10.61186/shefa.10.2.57.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Bujt�s, Csilla, Sandi Klav�ar, and Jing Tian. "Total mutual-visibility in Hamming graphs." Opuscula Mathematica 45, no. 1 (2025): 63–78. https://doi.org/10.7494/opmath.2025.45.1.63.

Full text

Abstract:

If \(G\) is a graph and \(X \subseteq V(G)\), then \(X\) is a total mutual-visibility set if every pair of vertices \(x\) and \(y\) of \(G\) admits the shortest \(x,y\)-path \(P\) with \(V(P) \cap X \subseteq \{x,y\}\). The cardinality of the largest total mutual-visibility set of \(G\) is the total mutual-visibility number \(\mu_{\rm t}(G)\) of \(G\). In this paper the total mutual-visibility number is studied on Hamming graphs, that is, Cartesian products of complete graphs. Different equivalent formulations for the problem are derived. The values \(\mu_{\rm t}(K_{n_1}\square K_{n_2}\square

APA, Harvard, Vancouver, ISO, and other styles

42

Krasnopevtsev, S. E. "Fourier Transform at the Workshop on Physical Optics of NSU." SIBERIAN JOURNAL OF PHYSICS 19, no. 2 (2024): 111–18. http://dx.doi.org/10.25205/2541-9447-2024-19-2-111-118.

Full text

Abstract:

Description of the development of a program in Python for analyzing interference images and generating a graph of the spectrum of a light source for a workshop on physical optics. Calibration of the Fourier transform and determination of frequency components in the composition of light are provided. A visibility graph is constructed and the visibility width is estimated.

APA, Harvard, Vancouver, ISO, and other styles

43

KEIL, MARK, DAVID M. MOUNT, and S. K. WISMATH. "VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME." International Journal of Computational Geometry & Applications 10, no. 05 (2000): 535–52. http://dx.doi.org/10.1142/s0218195900000309.

Full text

Abstract:

Given a set S of n non-intersecting line segments in the plane, we vpresent a new technique for efficiently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygons of the endpoints of S, in output sensitive time. Depth-first spiralling is a technique that relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depth-first search. It is a practical method and ha

APA, Harvard, Vancouver, ISO, and other styles

44

Diker, Melisa, and Ebru Harman Aslan. "Visibility Assessment of a Historical School Building through Isovists and Visibility Graph Analysis." Periodica Polytechnica Architecture 55, no. 1 (2024): 30–47. http://dx.doi.org/10.3311/ppar.36567.

Full text

Abstract:

City image includes people's perceptions of the built and natural environments as well as the emotions and ideas the city arouses in them. In the city image, the preservation of the buildings, especially historical buildings, which carry the past cultures, meaning and structural features of the city to the present day, can be ensured by making these buildings visible and perceptible by the inhabitants. Historical buildings' visibility can facilitate the recognition and appreciation of their historical significance, thereby contributing to the preservation of the city's cultural heritage. This

APA, Harvard, Vancouver, ISO, and other styles

45

Uras, Tansel, and Sven Koenig. "Identifying Hierarchies for Fast Optimal Search." Proceedings of the International Symposium on Combinatorial Search 5, no. 1 (2021): 211–12. http://dx.doi.org/10.1609/socs.v5i1.18307.

Full text

Abstract:

For some search problems, the graph is known beforehand and there is time to preprocess the graph to make the search faster. One such example is video games, where one can often preprocess maps before a game is released or while a map is loaded into memory. The data produced by preprocessing should use only a small amount of memory, and, in case they are generated during runtime, preprocessing should be fast. Search with Subgoal Graphs (Uras, Koenig, and Hernandez 2013) was a non-dominated optimal path-planning algorithm in the Grid-Based Path Planning Competitions 2012 and 2013. During a prep

APA, Harvard, Vancouver, ISO, and other styles

46

Becerra, Israel, Rafael Murrieta-Cid, Raul Monroy, Seth Hutchinson, and Jean-Paul Laumond. "Maintaining strong mutual visibility of an evader moving over the reduced visibility graph." Autonomous Robots 40, no. 2 (2015): 395–423. http://dx.doi.org/10.1007/s10514-015-9477-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Ma, Zhi-Yi, Xiao-Dong Yang, Ai-Jun He, Lu Ma, and Jun Wang. "Complex network recognition of electrocardiograph signals in health and myocardial infarction patients based on multiplex visibility graph." Acta Physica Sinica 71, no. 5 (2022): 050501. http://dx.doi.org/10.7498/aps.71.20211656.

Full text

Abstract:

The visibility graph algorithm proves to be a simple and efficient method to transform time series into complex network and has been widely used in time series analysis because it can inherit the dynamic characteristics of original time series in topological structure. Now, visibility graph analysis of univariate time series has become mature gradually. However, most of complex systems in real world are multi-dimensional, so the univariate analysis is difficult to describe the global characteristics when applied to multi-dimensional series. In this paper, a novel method of analyzing the multiv

APA, Harvard, Vancouver, ISO, and other styles

48

SRINIVASARAGHAVAN, G., and ASISH MUKHOPADHYAY. "ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES." International Journal of Computational Geometry & Applications 10, no. 01 (2000): 79–102. http://dx.doi.org/10.1142/s0218195900000061.

Full text

Abstract:

In this paper we report on a set of six necessary conditions that must be satisfied by the edge visibility graph of an orthogonal polygon with holes. We have also proved the following significant result: If G is a connected, bipartite, planar, and irreducible (in a sense defined in the paper) graph then it can be realized (that is, there is a corresponding orthogonal polygon with holes) up to leaf addition.

APA, Harvard, Vancouver, ISO, and other styles

49

Zeng, Zhen, and Yu Chen. "Identifying and Forecasting Recurrently Emerging Stock Trend Structures via Rising Visibility Graphs." Forecasting 7, no. 2 (2025): 26. https://doi.org/10.3390/forecast7020026.

Full text

Abstract:

This study introduces a novel forecasting framework that identifies and predicts recurrently emerging structural patterns in stock trends using rising visibility graphs (RVGs) and the Weisfeiler–Lehman (WL) subtree kernel. The proposed method, RVGWL, addresses a key limitation of traditional visibility graphs, namely the structural indistinguishability between rising and falling trends, by selectively constructing edges only along upward price movements. This approach produces graph representations that capture direction-sensitive market dynamics and facilitate the extraction of meaningful top

APA, Harvard, Vancouver, ISO, and other styles

50

Fabbri, Francesco, Francesco Bonchi, Ludovico Boratto, and Carlos Castillo. "The Effect of Homophily on Disparate Visibility of Minorities in People Recommender Systems." Proceedings of the International AAAI Conference on Web and Social Media 14 (May 26, 2020): 165–75. http://dx.doi.org/10.1609/icwsm.v14i1.7288.

Full text

Abstract:

Evaluating (and mitigating) the potential negative effects of algorithms has become a central issue in computer science. While research on algorithmic bias in ranking systems has dealt with disparate exposure of products or individuals, less attention has been devoted to the analysis of the disparate exposure of subgroups of online users.In this paper, we investigate the visibility of minorities in people recommender systems in social networks. Specifically, we consider a bi-populated social network, i.e., a graph where the nodes belong to two different groups (majority and minority) and, by a

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!