Results 251 to 260 of about 31,680 (296)
Some of the next articles are maybe not open access.
The number of triangular islands on a triangular grid
Periodica Mathematica Hungarica, 2009Using lattice theory, \textit{G.~Czédli} [Eur. J. Comb. 30, No 1, 208--215 (2009; Zbl 1187.05024)] has obtained a sharp upper bound for the number of rectangular islands. His methods are applied in the paper under review to estimate the number \(f(n)\) of triangular islands on a triangular grid with the side length \(n\): \((n^2 + 3n)/5 \leq f(n) \leq (
Eszter K Horvath, Horvath Eszter K
exaly +3 more sources
Topology preservation on the triangular grid
Annals of Mathematics and Artificial Intelligence, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Kardos +2 more
exaly +3 more sources
Mathematics and Computers in Simulation, 2020 The present work shows the first ever implementation of two-order moments conserving finite volume scheme (FVS) for approximating a multidimensional aggregation population balance equations (PBE\u27s) on a structured triangular grid. This scheme is based
Mehakpreet Singh +2 more
exaly +1 more source
Journal of Aerosol Science, 2019 In this present work, a finite volume scheme for approximating a multidimensional nonlinear agglomeration population balance equation on a regular triangular grid is developed.
Mehakpreet Singh +2 more
exaly +1 more source
Characterization and generation of straight line segments on triangular cell grid
Pattern Recognition Letters, 2018 International audienceIn this paper we are considering straight lines and straight line segments defined by two triangle centroids in the triangular cell grid.
Mousumi Dutt, Eric Andres
exaly +2 more sources
An optimal locating-dominating set in the infinite triangular grid
Discrete Mathematics, 2006 Assume that G=(V,E) is an undirected graph, and C⊆V. For every v∈V, we denote by I(v) the set of all elements of C that are within distance one from v.
Iiro Honkala
exaly +2 more sources
Discretization schemes on triangular grids
Computer Methods in Applied Mechanics and Engineering, 1998Physical applications posed on irregular domains have caused difficulties in the use of many, otherwise effective, discretization schemes. In two-dimensional examples, we consider discretization schemes on triangles to approximate irregular domains.
Ewing, Richard E. +2 more
openaire +1 more source
Parallel thinning on the triangular grid
2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom), 2013One of the fundamental issues of human and computational cognitive psychology is pattern or shape recognition. Various applications in image processing and computer vision rely on skeleton-like shape features A possible technique for extracting these feautures is thinning. Although the majority of 2D thinning algorithms work on digital pictures sampled
Kardos Péter, Palágyi Kálmán
openaire +2 more sources
On the Chamfer Polygons on the Triangular Grid
2017Weighted (or with other name, chamfer) distances on the triangular grid was introduced recently based on the three well-known neighborhoods. By having various values of the three used weights, the approximation of the Euclidean disks are shown, based on the isoperimetric ratio. Our results are also compared to similar results on the square grid.
Mir-Mohammad-Sadeghi, Hamid +1 more
openaire +2 more sources
Triangular grids on the sphere
2022<p class="western" align="justify">Inverting LRI data from GRACE-FO (NASA/GFZ) is challenging from&#160; multiple points of view. To benefit from the laser instrument, that provides a higher precision compared with the KBR ranging, the global basis functions such as spherical harmonics may not ...
Josef Sebera +2 more
openaire +1 more source