Tessellations of solvmanifolds

Let be a closed subgroup of a connected, solvable Lie group , such that the homogeneous space is simply connected. As a special case of a theorem of C. T. C. Wall, it is known that every tessellation of is finitely covered by a compact homogeneous space . We prove that the covering map can be taken to be very well behaved - a ``crossed" affine map. This establishes a connection between the geometry of the tessellation and the geometry of the homogeneous space. In particular, we see that every geometrically-defined flow on that has a dense orbit is covered by a natural flow on .

     

Edge-Weighted Centroidal Voronoi Tessellations

<正>Most existing applications of centroidal Voronoi tessellations(CVTs) lack consideration of the length of the cluster boundaries.In this paper we propose a new model and algorithms to produce segmentations which would minimize the total energy—a sum of the classic CVT energy and the weighted length of cluster boundaries.To distinguish it with the classic CVTs,we call it an Edge-Weighted CVT(EWCVT).The concept of EWCVT is expected to build a mathematical base for all CVT related data classifications with requirement of smoothness of the cluster boundaries.The EWCVT method is easy in implementation,fast in computation,and natural for any number of clusters.     

Tessellations generated by hyperplanes

Let be a locally finite system of hyperplanes in ^d with the property that the cells of the induced cell complex decomposition of ^d have uniformly bounded diameters. If is simple and the density of the vertices in exists, then the density of thek-cells in exists and can be given explicitly (k = 1, ...,d). Also, the mean number ofj-faces of thek-cells in exists and can be calculated. For certain nonsimple systems , corresponding inequalities are obtained.     

Typical Cells in Poisson Hyperplane Tessellations

It is proved that the shape of the typical cell of a stationary and isotropic Poisson random hyperplane tessellation is, with high probability, close to the shape of a ball if the kth intrinsic volume (k ≥ 2) of the typical cell is large. The shape of typical cells of large diameter is close to the shape of a segment.     

Bernoulli Cluster Field: Voronoi Tessellations

A new point process is proposed which can be viewed either as a Boolean cluster model with two cluster modes or as a p-thinned Neyman-Scott cluster process with the retention of the original parent point. Voronoi tessellation generated by such a point process has extremely high coefficients of variation of cell volumes as well as of profile areas and lengths in the planar and line induced tessellations. An approximate numerical model of tessellation characteristics is developed for the case of small cluster size; its predictions are compared with the results of computer simulations. Tessellations of this type can be used as models of grain structures in steels.     

Dimension Reduction by Random Hyperplane Tessellations

Given a subset K of the unit Euclidean sphere, we estimate the minimal number m=m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x,y∈K is nearly proportional to the Euclidean distance between x and y. Random hyperplanes prove to be almost ideal for this problem; they achieve the almost optimal bound m=O(w(K)²) where w(K) is the Gaussian mean width of K. Using the map that sends x∈K to the sign vector with respect to the hyperplanes, we conclude that every bounded subset K of $\mathbb{R}^{n}$ embeds into the Hamming cube {?1,1} ^m with a small distortion in the Gromov–Haussdorff metric. Since for many sets K one has m=m(K)?n, this yields a new discrete mechanism of dimension reduction for sets in Euclidean spaces.     

The Combinatorial Structure of Spatial STIT Tessellations

Spatially homogeneous random tessellations that are stable under iteration (nesting) in the $3$ 3 -dimensional Euclidean space are considered, so-called STIT tessellations. They arise as outcome of a space-time process of subsequent cell division and, consequently, they are not facet-to-facet. The intent of this paper is to develop a detailed analysis of the combinatorial structure of such tessellations and to determine a number of new geometric mean values, for example for the neighbourhood of the typical vertex. The heart of the results is a fine classification of tessellation edges based on the type of their endpoints or on the equality relationship with other types of line segments. In the background of the proofs are delicate distributional properties of spatial STIT tessellations.     

2D Centroidal Voronoi Tessellations with Constraints

<正>We tackle the problem of constructing 2D centroidal Voronoi tessellations with constraints through an efficient and robust construction of bounded Voronoi diagrams, the pseudo-dual of the constrained Delaunay triangulation.We exploit the fact that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary ones against the constrained Delaunay edges.The clipping itself is efficiently computed by identifying for each constrained edge the(connected) set of triangles whose dual Voronoi vertices are hidden by the constraint.The resulting construction is amenable to Lloyd relaxation so as to obtain a centroidal tessellation with constraints.     

Exploration of Gibbs-Laguerre Tessellations for Three-Dimensional Stochastic Modeling

Random tessellations are well suited for probabilistic modeling of three-dimensional (3D) grain microstructures of polycrystalline materials. The present paper is focused on so-called Gibbs-Laguerre tessellations, in which the generators of the Laguerre tessellation form a Gibbs point process. The goal is to construct an energy function of the Gibbs point process such that the resulting tessellation matches some desired geometrical properties. Since the model is analytically intractable, our main tool of analysis is stochastic simulation based on Markov chain Monte Carlo. Such simulations enable us to investigate the properties of the models, and, in the next step, to apply the knowledge gained to the statistical reconstruction of the 3D microstructure of an aluminum alloy extracted from 3D tomographic image data.

     

Asymptotics for Statistical Distances Based on Voronoi Tessellations

We obtain an information-type inequality and a strong law for a wide class of statistical distances between empirical estimates and random measures based on Voronoi tessellations. This extends some basic results in the asymptotic theory of sample spacings, when the cells of the Voronoi tessellation are interpreted as d-dimensional spacings.     

Asymptotic Shapes of large Cells in Random Tessellations

We establish a close relationship between isoperimetric inequalities for convex bodies and asymptotic shapes of large random polytopes, which arise as cells in certain random mosaics in d-dimensional Euclidean space. These mosaics are generated by Poisson hyperplane processes satisfying a few natural assumptions (not necessarily stationarity or isotropy). The size of large cells is measured by a class of general functionals. The main result implies that the asymptotic shapes of large cells are completely determined by the extremal bodies of an inequality of isoperimetric type, which connects the size functional and the expected number of hyperplanes of the generating process hitting a given convex body. We obtain exponential estimates for the conditional probability of large deviations of zero cells from asymptotic or limit shapes, under the condition that the cells have large size. This work was supported in part by the European Network PHD, FP6 Marie Curie Actions, RTN, Contract MCRN-511953. Received: May 2005 Accepted: September 2005     

Advances in Studies and Applications of Centroidal Voronoi Tessellations

<正>Centroidal Voronoi tessellations(CVTs) have become a useful tool in many applications ranging from geometric modeling,image and data analysis,and numerical partial differential equations,to problems in physics,astrophysics,chemistry,and biology. In this paper,we briefly review the CVT concept and a few of its generalizations and well-known properties.We then present an overview of recent advances in both mathematical and computational studies and in practical applications of CVTs.Whenever possible,we point out some outstanding issues that still need investigating.     

Tessellations in three-dimensional hyperbolic space from dynamics and the quaternions

Automatic generation of coloured patterns in the three-dimensional hyperbolic space is considered from a dynamical system’s point of view. Equivariant mappings with the symmetry of the Picard group is constructed. A convergence colour scheme is described, which reveals the convergence rate of various orbits and, at the same time, enhances the artistic appeal of a generated image. This method can be used to create a great variety of exotic symmetrical patterns.     

On the Arrangement of Cells in Planar STIT and Poisson Line Tessellations

It is well known that the distributions of the interiors of the typical cells of a Poisson line tessellation and a STIT tessellation with the same parameters coincide. In this paper, differences in the arrangement of the cells in these two tessellation models are investigated. In particular, characteristics of the set of cells neighbouring the typical cell are studied, mainly by simulation. Furthermore, the pair-correlation function and several mark correlation functions of the point processes of cell centres are estimated and compared.     

Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations

Abstract. Tilings of R ² can display hierarchy similar to that seen in the limit sequences of substitutions. Self-similarity for tilings has been used as the standard generalization, but this viewpoint is limited because such tilings are analogous to limit points of constant-length substitutions. To generalize limit points of non-constant-length substitutions, we define hierarchy for infinite, labelled graphs, then extend this definition to tilings via their dual graphs. Examples of combinatorially substitutive tilings that are not self-similar are given. We then find a sufficient condition for detecting combinatorial hierarchy that is motivated by the characterization by Durand of substitutive sequences. That characterization relies upon the construction of the ``derived sequence'—a recoding in terms of reappearances of an initial block. Following this, we define the ``derived Vorono? tiling'—a retiling in terms of reappearances of an initial patch of tiles. Using derived Vorono? tilings, we obtain a sufficient condition for a tiling to be combinatorially substitutive.     

Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations

   Abstract. Tilings of R ² can display hierarchy similar to that seen in the limit sequences of substitutions. Self-similarity for tilings has been used as the standard generalization, but this viewpoint is limited because such tilings are analogous to limit points of constant-length substitutions. To generalize limit points of non-constant-length substitutions, we define hierarchy for infinite, labelled graphs, then extend this definition to tilings via their dual graphs. Examples of combinatorially substitutive tilings that are not self-similar are given. We then find a sufficient condition for detecting combinatorial hierarchy that is motivated by the characterization by Durand of substitutive sequences. That characterization relies upon the construction of the ``derived sequence'—a recoding in terms of reappearances of an initial block. Following this, we define the ``derived Vorono? tiling'—a retiling in terms of reappearances of an initial patch of tiles. Using derived Vorono? tilings, we obtain a sufficient condition for a tiling to be combinatorially substitutive.     

Second-Order Characteristics of the Edge System of Random Tessellations and the PPI Value of Foams

The mean number of pores per inch (PPI) is widely used as a pore size characteristic for foams. Nevertheless, there is still a lack of fast and reliable methods for estimating this quantity. We propose a method for estimating the PPI value based on the Bartlett spectrum of a dark field image of the material. To this end, second-order properties of the edge systems of random tessellations are investigated in detail. In particular, we study the spectral density of the random length measure of the edges. It turns out that the location of its first local maximum is proportional to the PPI value. To determine the factor of proportionality, several random tessellation models as well as examples of real foams are investigated. To mimic the image acquisition process, 2D sections and projections of 3D tessellations are considered.