Results 1 to 10 of about 28,102 (266)
Vector Arithmetic in the Triangular Grid [PDF]
Entropy, 2021 Vector arithmetic is a base of (coordinate) geometry, physics and various other disciplines. The usual method is based on Cartesian coordinate-system which fits both to continuous plane/space and digital rectangular-grids.
Khaled Abuhmaidan +2 more
doaj +5 more sources
TriCCo v1.1.0 – a cubulation-based method for computing connected components on triangular grids [PDF]
Geoscientific Model Development, 2022 We present a new method to identify connected components on triangular grids used in atmosphere and climate models to discretize the horizontal dimension.
A. Voigt +3 more
doaj +1 more source
Sensors, 2021 The beneficial effects of adopting a triangular lattice on phased arrays with regular and periodic grids for high-altitude platform station (HAPS) systems are presented in the scenario of massive MIMO communications operating within the 5G NR n257 and ...
Francesco Alessio Dicandia +1 more
doaj +1 more source
Triangular-grid billiards and plabic graphs
Combinatorial Theory, 2023 16 pages, 13 ...
Defant, Colin, Jiradilok, Pakawut
openaire +5 more sources
A Triangular Grid Filter Method Based on the Slope Filter
Remote Sensing, 2023 High-precision ground point cloud data has a wide range of applications in various fields, and the separation of ground points from non-ground points is a crucial preprocessing step.
Chuanli Kang +5 more
doaj +1 more source
Applied Sciences, 2021 Three-dimensional finite element (FE) simulations were performed to further develop the Swedish design guidelines for geogrid-reinforced timber pile-supported embankments, also known as lightly piled embankments. Lightly piled embankments are constructed
Per Gunnvard, Hans Mattsson, Jan Laue
doaj +1 more source
Derivative-Free Power Flow Solution for Bipolar DC Networks with Multiple Constant Power Terminals
Sensors, 2022 This paper analyzes the power flow solution in bipolar direct current networks with radial structures considering multiple monopolar and bipolar constant power loads.
Ángeles Medina-Quesada +2 more
doaj +1 more source
Edge-Bandwidth of the Triangular Grid [PDF]
The Electronic Journal of Combinatorics, 2007 In 1995, Hochberg, McDiarmid, and Saks proved that the vertex-bandwidth of the triangular grid $T_n$ is precisely $n+1$; more recently Balogh, Mubayi, and Pluhár posed the problem of determining the edge-bandwidth of $T_n$. We show that the edge-bandwidth of $T_n$ is bounded above by $3n-1$ and below by $3n-o(n)$.
Akhtar, Reza, Jiang, Tao, Pritikin, Dan
openaire +2 more sources
On the Number of Shortest Weighted Paths in a Triangular Grid
Mathematics, 2020 Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its
Benedek Nagy, Bashar Khassawneh
doaj +1 more source
A Note on Triple Repetition Sequence of Domination Number in Graphs
InPrime, 2022 A set D subset of V(G) is a dominating set of a graph G if for all x ϵ V(G)\D, for some y ϵ D such that xy ϵ E(G). A dominating set D subset of V(G) is called a connected dominating set of a graph G if the subgraph induced by D is connected. A connected
Leomarich F. Casinillo +2 more
doaj +1 more source