The regular parqueting problem is considered as the problem of finding all forms of bounded domains by means of which the Euclidean plane can be covered in at least one manner, simply, without holes, by adjacent congruent samples, so that every sample is surrounded in an identical manner by the totality thereof, or, what is equivalent, that one of the seventeen properly discontinuous groups of congruent mappings of the plane on itself, operates on the covering in a manner which is transitive on the domains. In these mappings, both direct and indirect congruence are allowed. Furthermore, it is required that the boundary of a domain be piecewise smooth. The solution consists of a system of 28 basic types of tessellations. Any basic type includes infinitely many forms of domains; among them are infinitely many belonging only to that one basic type. Every basic type is characterized by a rule by which all domains of this type are constructed. The element of these constructions for all basic types is the random line.
Produktkennzeichnungen
ISBN-10
3322979660
ISBN-13
9783322979667
eBay Product ID (ePID)
195264889
Produkt Hauptmerkmale
Produktart
Lehrbuch
Sprache
Deutsch
Anzahl der Seiten
104 Seiten
Verlag
Vs Verlag für Sozialwissenschaften
Publikationsname
Reguläres Parkettierungsproblem
Autor
Heinrich Heesch
Format
Taschenbuch
Erscheinungsjahr
1968
Zusätzliche Produkteigenschaften
Hörbuch
No
Inhaltsbeschreibung
Paperback
Item Length
24cm
Item Height
5mm
Item Width
17cm
Nummer Innerhalb der Serie
172
Buchreihe
Arbeitsgemeinschaft für Forschung des Landes Nordrhein-Westfalen
Item Weight
196g
Meistverkauft in Studium & Erwachsenenbildung
Aktuelle Folie {CURRENT_SLIDE} von {TOTAL_SLIDES}- Meistverkauft in Studium & Erwachsenenbildung