Add to ORKGAfter the discovery of the 219 (230) Euclidean three-dimensional space groups many interesting questions have been investigated, e.g. questions related to space filling polyhedra. The goal of this paper is to illustrate maximal tilings in E3 in the sense of Delaney-Dress symbols, using just a few barycentric simplex orbits and many symmetries
The derivation of crystallographic groups in the Euclidean n-space S" (think of n = 2,3) w...
The derivation of crystallographic groups in the Euclidean n-space S" (think of n = 2,3) w...
In this snapshot, we will first give an introduction to hyperbolic geometry and we will then show ho...
This paper presents an algorithm which allows to derive classification methods concerning periodic t...
. The purpose of this paper is to popularize the method of D-symbols (Delone--Delaney--Dress symbols...
In this paper we introduce a polyhedron algorithm that has been developed for finding space groups. ...
This paper presents an algorithm which allows to derive classification methods concerning periodic t...
Accepted and to appearInternational audienceWe present a technique for the enumeration of all isotop...
AbstractBased on the mathematical theory of Delaney symbols, data structures and algorithms are pres...
The vertex corona of a vertex of some tiling is the vertex together with the adjacent tiles. A tilin...
Aperiodic tilings are interesting to mathematicians and scientists for both theoretical and practica...
In this paper we describe the data structures and the procedures of a program, which is...
The problem of tiling or tessellating (i.e., completely filling) three-dimensional Euclidean space R...
In this paper we describe the data structures and the procedures of a program, which is...
AbstractMany complex structures may be generated from simple modules with the aid of an algorithm or...
The derivation of crystallographic groups in the Euclidean n-space S" (think of n = 2,3) w...
The derivation of crystallographic groups in the Euclidean n-space S" (think of n = 2,3) w...
In this snapshot, we will first give an introduction to hyperbolic geometry and we will then show ho...
This paper presents an algorithm which allows to derive classification methods concerning periodic t...
. The purpose of this paper is to popularize the method of D-symbols (Delone--Delaney--Dress symbols...
In this paper we introduce a polyhedron algorithm that has been developed for finding space groups. ...
This paper presents an algorithm which allows to derive classification methods concerning periodic t...
Accepted and to appearInternational audienceWe present a technique for the enumeration of all isotop...
AbstractBased on the mathematical theory of Delaney symbols, data structures and algorithms are pres...
The vertex corona of a vertex of some tiling is the vertex together with the adjacent tiles. A tilin...
Aperiodic tilings are interesting to mathematicians and scientists for both theoretical and practica...
In this paper we describe the data structures and the procedures of a program, which is...
The problem of tiling or tessellating (i.e., completely filling) three-dimensional Euclidean space R...
In this paper we describe the data structures and the procedures of a program, which is...
AbstractMany complex structures may be generated from simple modules with the aid of an algorithm or...
The derivation of crystallographic groups in the Euclidean n-space S" (think of n = 2,3) w...
The derivation of crystallographic groups in the Euclidean n-space S" (think of n = 2,3) w...
In this snapshot, we will first give an introduction to hyperbolic geometry and we will then show ho...