نتایج جستجو برای: horizontal visibility
تعداد نتایج: 79230 فیلتر نتایج به سال:
(a) (b) Figure 8: The nal set of directions from that covers G S in thick gray lines. Two views are provided with (a) presents the regular view of Figures 5 to 7 and (b) shows the entire Gauss map. See also Figure 1. (a) (b) Figure 6: The boundary and central silhouettes of G S in thick dark gray lines is projected onto the plane z = 1 in thick light gray lines, in (a). In (b), The convex hull ...
A recently proposed methodology called the Horizontal Visibility Graph (HVG) [Luque et al., Phys. Rev. E., 80, 046103 (2009)] that constitutes a geometrical simplification of the well known Visibility Graph algorithm [Lacasa et al., Proc. Natl. Sci. U.S.A. 105, 4972 (2008)], has been used to study the distinction between deterministic and stochastic components in time series [L. Lacasa and R. T...
A study of the long-term variability; trend and characteristics of visibility in four zones of Nigeria was carried out. Visibility and other meteorological data from NOAA-NCDC and aerosol index data over Nigeria during 1984–2013 are analyzed using time series and simple regression model. There are significant decreasing trends for every region and season during the 30-years period; the fluctuat...
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical time series analysis and signal processing and (ii) characterizing classes of dynamical systems and stochastic processes using the tools of graph theory. Recent works show that the degree distribution of these graphs encapsulates much inf...
چکیده کوه آصف در شمال شهر شیراز قرار داشته که بخشی از جنوبباختری زاگرس چینخورده است. ناحیهی زاگرس چینخورده یکی از مناطق فعال زمین ساختی ایران به شمار میآید. در این منطقه سازندهای سنوزوئیک بر اثر فرایندهای تکتونیکی دچار چینخوردگی شدهاند. نتایج بررسیها نشان میدهد که سطح محوری چینخوردگیها در این منطقه دارای روند غالب شمالباختر- جنوب خاور میباشد، یعنی از روند عمومی زاگرس تبعیت میکن...
A graph is called a bar 1-visibility graph if its vertices can be represented as horizontal segments, called bars, and each edge corresponds to a vertical line of sight which can traverse another bar. If all bars are aligned at one side, then the graph is an aligned bar 1-visibility graph, AB1V graph for short. We consider AB1V graphs from different angles. First, we study combinatorial propert...
Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P . We build a data structure in O(n) time and O(n) space that can compute the visibility polygon for any query line segment s in O(k log n) time, where k is the size of the visibility polygon of s and n is the number of vertices of P . Al...
Unit square (grid) visibility graphs (USV and USGV, resp.) are described by axisparallel visibility between unit squares placed (on integer grid coordinates) in the plane. We investigate combinatorial properties of these graph classes and the hardness of variants of the recognition problem, i. e., the problem of representing USGV with fixed visibilities within small area and, for USV, the gener...
We analyze how to efficiently maintain and update the visibility polygons for a segment observer moving in a polygonal domain. The space and time requirements for preprocessing are O(n) and after preprocessing, visibility change events for weak and strong visibility can be handled in O(log |VP|) and O(log(|VP1| + |VP2|)) respectively, or O(log n) in which |VP| is the size of the line segment’s ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید