On Maximal Homogeneous 3-Geometries—A Polyhedron Algorithm for Space Tilings

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Shuffling Algorithm for Domino Tilings∗

We study the dynamics of a certain discrete model of interacting interlaced particles that comes from the so called shuffling algorithm for sampling a random tiling of an Aztec diamond. It turns out that the transition probabilities have a particularly convenient determinantal form. An analogous formula in a continuous setting has recently been obtained by Jon Warren studying certain model of i...

متن کامل

Research on Parallel Collision Detection Algorithm for polyhedron Models

Collision detection among complex polyhedron models is an open question because of its algorithmic complexity. To satisfy the real-time collision detection requirement of polyhedrons, we presented a parallel algorithm to perform collision detection for polyhedrons models. The algorithm decomposes nonconvex polyhedron into tetrahedrons, then detect thetetrahedrons in parallel, and boxtree of the...

متن کامل

Space Tilings and Substitutions

We generalize the study of symbolic dynamical systems of nite type and ZZ 2 action, and the associated use of symbolic substitution dynamical systems, to dynamical systems with IR 2 action. The new systems are associated with tilings of the plane. We generalize the classical technique of the matrix of a substitution to include the geometrical information needed to study tilings, and we utilize ...

متن کامل

A Maximal-Space Algorithm for the Container Loading Problem

In this paper a greedy randomized adaptive search procedure (GRASP) for the container loading problem is presented. This approach is based on a constructive block heuristic that builds upon the concept of maximal-space, a non-disjoint representation of the free space in a container. This new algorithm is extensively tested over the complete set of Bischoff and Ratcliff problems, ranging from we...

متن کامل

Dodecagonal Tilings as Maximal Cluster Coverings

It is shown that the Socolar tiling, which is quasiperiodic and 12-fold symmetric , can be characterized as the unique tiling which is maximally covered by a suitably pair of clusters. Analogous results can be obtained also for other dodecagonal tilings, among them the shield tiling.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Universe

سال: 2018

ISSN: 2218-1997

DOI: 10.3390/universe4030049