next up previous
Next: About this document ... Up: Data structures and algorithms Previous: Algorithms

Bibliography


Bal90
L. Balke.
Diskontinuierliche Gruppen als Automorphismengruppen von Pflasterungen.
Bonner mathematische Schriften, Bonn, Germany, 1990.
(master thesis).

Bea99
David Beazley.
Python essential reference.
New Riders, 1999.

BM98
Attila Bölcskei and Emil Molnár.
How to design nice tilings?
KoG, 3:21-28, 1998.

Cho80
W.W. Chow.
Automatic generation of interlocking shapes.
Computer Aided Design, 12:29-34, 1980.

DDH$^+$99
O. Delgado Friedrichs, A.W.M. Dress, D.H. Huson, J. Klinowski, and A.L. Mackay.
Systematic enumeration of crystalline networks.
Nature, 400:644-647, 1999.

DDŠ80
B.N. Delone, N.P. Dolbilin, and M.I. Štogrin.
Combinatorial and metric theory of planigons.
Proc. of the Steklov Inst. of Math., 4:111-141, 1980.

Del80
M.S. Delaney.
Quasisymmetries of space group orbits.
Match, 9:73-80, 1980.

Del00
O. Delgado Friedrichs.
Recognition of flat orbifolds and the classification of tilings in R3.
To appear in: Discrete and Computational Geometry, 2000.

DH87
A.W.M. Dress and D.H. Huson.
On tilings of the plane.
Geometriae Dedicata, 24:295-310, 1987.

DH98
O. Delgado Friedrichs and D.H. Huson.
A combinatorial theory of tilings.
In P. Engel and H. Syta, editors, Voronoï's Impact on Modern Science. Book II., pages 85-95. National Academy of Science of Ukraine, Institute of Mathematics, 1998.
Proceedings Vol. 21.

Dre84
A.W.M. Dress.
Regular polytopes and equivariant tessellations from a combinatorial point of view.
In Algebraic Topology, pages 56-72. SLN 1172, Göttingen, 1984.

Dre87
A.W.M. Dress.
Presentations of discrete groups, acting on simply connected manifolds.
Adv. in Math., 63:196-212, 1987.

GS79
B. Grünbaum and G.C. Shephard.
Incidence symbols and their applications.
In Relations between Combinatorics and Other Parts of Mathematics, volume 34, pages 199-244, 1979.

GS81
B. Grünbaum and G.C. Shephard.
A hierarchy of classification methods for patterns.
Zeitschrift f. Kristallographie, 154:163-187, 1981.

GS87
B. Grünbaum and G.C. Shephard.
Tilings and Patterns.
W.H. Freeman and Company, New York, 1987.

Hee68
H. Heesch.
Reguläres Parkettierungsproblem.
Westdeutscher Verlag, Köln-Opladen, 1968.

Hus93
D.H. Huson.
The generation and classification of tile-k-transitive tilings of the euclidean plane, the sphere and the hyperbolic plane.
Geometriae Dedicata, 47:269-296, 1993.

MP94
E. Molnár and I. Prok.
Classification of solid transitive simplex tilings in simply connected 3-spaces. I. The combinatorial description by figures and tables, results in spaces of constant curvature.
In Intuitive geometry (Szeged, 1991), pages 311-362. North-Holland, Amsterdam, 1994.

MPS97
E. Molnár, I. Prok, and J. Szirmai.
Classification of solid transitive simplex tilings in simply connected 3-spaces. II. Metric realizations of the maximal simplex tilings.
Period. Math. Hungar., 35(1-2):47-94, 1997.

Pyt00
Python language website.
http://www.python.org, 2000.

Sed88
R. Sedgewick.
Algorithms.
Addison-Wesley, Reading Mass., 1988.


Hosted by:
SourceForge.net Logo
Author: Olaf Delgado-Friedrichs (odf at users.sourceforge.net)   Date: July 28, 2005