Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Item TypeItem Type
-
SubjectSubject
-
YearFrom:-To:
-
More FiltersMore FiltersSourceLanguage
Done
Filters
Reset
3,638
result(s) for
"Tessellation"
Sort by:
The -Delaunay tessellation: Description of the model and geometry of typical cells
2022
In this paper we introduce two new classes of stationary random simplicial tessellations, the so-called$\\beta$- and$\\beta^{\\prime}$-Delaunay tessellations. Their construction is based on a space–time paraboloid hull process and generalizes that of the classical Poisson–Delaunay tessellation. We explicitly identify the distribution of volume-power-weighted typical cells, establishing thereby a remarkable connection to the classes of$\\beta$- and$\\beta^{\\prime}$-polytopes. These representations are used to determine the principal characteristics of such cells, including volume moments, expected angle sums, and cell intensities.
Journal Article
Dynamics of the Box-Ball System with Random Initial Conditions via Pitman’s Transformation
by
Tsujimoto, Satoshi
,
Croydon, David A.
,
Sasada, Makiko
in
Cellular automata
,
Dynamical systems and ergodic theory -- Topological dynamics -- Cellular automata msc
,
Ergodic theory
2023
The box-ball system (BBS), introduced by Takahashi and Satsuma in 1990, is a cellular automaton that exhibits solitonic behaviour. In
this article, we study the BBS when started from a random two-sided infinite particle configuration. For such a model, Ferrari et al.
recently showed the invariance in distribution of Bernoulli product measures with density strictly less than
A Novel Approach to Discrete Representative Volume Element Automation and Generation-DRAGen
by
Henrich, Manuel
,
Pütz, Felix
,
Münstermann, Sebastian
in
Algorithms
,
Computer simulation
,
Generators
2020
In this study, a novel approach for generating Representative Volume Elements (RVEs) is introduced. In contrast to common generators, the new RVE generator is based on discrete methods to reconstruct synthetic microstructures, using simple methods and a modular structure. The plain and uncomplicated structure of the generator makes the extension with new features quite simple. It is discussed why certain features are essential for microstructural simulations. The discrete methods are implemented into a python tool. A Random Sequential Addition (RSA)-Algorithm for discrete volumes is developed and the tessellation is realized with a discrete tessellation function. The results show that the generator can successfully reconstruct realistic microstructures with elongated grains and martensite bands from given input data sets.
Journal Article
Random coverage from within with variable radii, and Johnson-Mehl cover times
2025
Given a compact planar region \\(A\\), let \\(\\tau_A\\) be the (random) time it takes for the Johnson-Mehl tessellation of \\(A\\) to be complete, i.e. the time it takes for \\(A\\) to be fully covered by a spatial birth-growth process in \\(A\\) with seeds arriving as a unit-intensity Poisson point process in \\(A \\times [0,\\infty)\\), where upon arrival each seed grows at unit rate in all directions. We show that if \\(\\partial A\\) is smooth or polygonal then \\(\\Pr [ \\pi \\tau_{sA}^3 - 6 \\log s - 4 \\log \\log s \\leq x]\\) tends to \\(\\exp(- (\\frac{81}{4\\pi})^{1/3} |A|e^{-x/3} -(\\frac{9}{2\\pi^2})^{1/3} |\\partial A| e^{-x/6})\\) in the large-\\(s\\) limit; the second term in the exponent is due to boundary effects, the importance of which was not recognized in earlier work on this model. We present similar results in higher dimensions (where boundary effects dominate). These results are derived using new results on the asymptotic probability of covering \\(A\\) with a high-intensity spherical Poisson Boolean model restricted to \\(A\\) with grains having iid small random radii, which generalize recent work of the first author that dealt only with grains of deterministic radius.
Random Laguerre tessellations
2008
A systematic study of random Laguerre tessellations, weighted generalisations of the well-known Voronoi tessellations, is presented. We prove that every normal tessellation with convex cells in dimension three and higher is a Laguerre tessellation. Tessellations generated by stationary marked Poisson processes are then studied in detail. For these tessellations, we obtain integral formulae for geometric characteristics and densities of the typical k-faces. We present a formula for the linear contact distribution function and prove various limit results for convergence of Laguerre to Poisson-Voronoi tessellations. The obtained integral formulae are subsequently evaluated numerically for the planar case, demonstrating their applicability for practical purposes.
Journal Article
Tessellation-valued processes that are generated by cell division
2024
Processes of random tessellations of the Euclidean space
$\\mathbb{R}^d$
,
$d\\geq 1$
, are considered that are generated by subsequent division of their cells. Such processes are characterized by the laws of the life times of the cells until their division and by the laws for the random hyperplanes that divide the cells at the end of their life times. The STIT (STable with respect to ITerations) tessellation processes are a reference model. In the present paper a generalization concerning the life time distributions is introduced, a sufficient condition for the existence of such cell division tessellation processes is provided, and a construction is described. In particular, for the case that the random dividing hyperplanes have a Mondrian distribution—which means that all cells of the tessellations are cuboids—it is shown that the intrinsic volumes, except the Euler characteristic, can be used as the parameter for the exponential life time distribution of the cells.
Journal Article
Observation of novel topological states in hyperbolic lattices
by
Yuan, Hao
,
Zhang, Xiangdong
,
Zhang, Weixuan
in
639/166/987
,
639/301/1005/1007
,
639/766/119/2792/4128
2022
The discovery of novel topological states has served as a major branch in physics and material sciences. To date, most of the established topological states have been employed in Euclidean systems. Recently, the experimental realization of the hyperbolic lattice, which is the regular tessellation in non-Euclidean space with a constant negative curvature, has attracted much attention. Here, we demonstrate both in theory and experiment that exotic topological states can exist in engineered hyperbolic lattices with unique properties compared to their Euclidean counterparts. Based on the extended Haldane model, the boundary-dominated first-order Chern edge state with a nontrivial real-space Chern number is achieved. Furthermore, we show that the fractal-like midgap higher-order zero modes appear in deformed hyperbolic lattices, and the number of zero modes increases exponentially with the lattice size. These novel topological states are observed in designed hyperbolic circuit networks by measuring site-resolved impedance responses and dynamics of voltage packets. Our findings suggest a useful platform to study topological phases beyond Euclidean space, and may have potential applications in the field of high-efficient topological devices, such as topological lasers, with enhanced edge responses.
Recent evidence of hyperbolic lattice calls for whether topological states can exist in such non-Euclidean system. Here, the authors evidence firstorder Chern edge states with a nontrivial real-space Chern number and fractal-like midgap higher-order zero modes in hyperbolic circuit networks.
Journal Article
Random Conical Tessellations
by
Hug, Daniel
,
Schneider, Rolf
in
Combinatorial analysis
,
Combinatorics
,
Computational Mathematics and Numerical Analysis
2016
We consider tessellations of the Euclidean
(
d
-
1
)
-sphere by
(
d
-
2
)
-dimensional great subspheres or, equivalently, tessellations of Euclidean
d
-space by hyperplanes through the origin; these we call conical tessellations. For random polyhedral cones defined as typical cones in a conical tessellation by random hyperplanes, and for random cones which are dual to these in distribution, we study expectations for a general class of geometric functionals. They include combinatorial quantities, such as face numbers, as well as, for example, conical intrinsic volumes. For isotropic conical tessellations (those generated by random hyperplanes with spherically symmetric distribution), we determine the complete covariance structure of the random vector whose components are the
k
-face contents of the induced spherical random polytopes. This result can be considered as a spherical counterpart of a classical result due to Roger Miles.
Journal Article
Symmetric waterbomb origami
2016
The traditional waterbomb origami, produced from a pattern consisting of a series of vertices where six creases meet, is one of the most widely used origami patterns. From a rigid origami viewpoint, it generally has multiple degrees of freedom, but when the pattern is folded symmetrically, the mobility reduces to one. This paper presents a thorough kinematic investigation on symmetric folding of the waterbomb pattern. It has been found that the pattern can have two folding paths under certain circumstance. Moreover, the pattern can be used to fold thick panels. Not only do the additional constraints imposed to fold the thick panels lead to single degree of freedom folding, but the folding process is also kinematically equivalent to the origami of zero-thickness sheets. The findings pave the way for the pattern being readily used to fold deployable structures ranging from flat roofs to large solar panels.
Journal Article
Converting Tessellations into Graphs: From Voronoi Tessellations to Complete Graphs
by
Nosonovsky, Michael
,
Frenkel, Mark
,
Bormashenko, Edward
in
Apexes
,
Entropy
,
Entropy (Information theory)
2024
A mathematical procedure enabling the transformation of an arbitrary tessellation of a surface into a bi-colored, complete graph is introduced. Polygons constituting the tessellation are represented by vertices of the graphs. Vertices of the graphs are connected by two kinds of links/edges, namely, by a green link, when polygons have the same number of sides, and by a red link, when the polygons have a different number of sides. This procedure gives rise to a semi-transitive, complete, bi-colored Ramsey graph. The Ramsey semi-transitive number was established as Rtrans(3,3)=5 Shannon entropies of the tessellation and graphs are introduced. Ramsey graphs emerging from random Voronoi and Poisson Line tessellations were investigated. The limits ζ=limN→∞NgNr, where N is the total number of green and red seeds, Ng and Nr, were found ζ= 0.272 ± 0.001 (Voronoi) and ζ= 0.47 ± 0.02 (Poisson Line). The Shannon Entropy for the random Voronoi tessellation was calculated as S= 1.690 ± 0.001 and for the Poisson line tessellation as S = 1.265 ± 0.015. The main contribution of the paper is the calculation of the Shannon entropy of the random point process and the establishment of the new bi-colored Ramsey graph on top of the tessellations.
Journal Article