ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 303, Issues 2-3, 15 July 2003, Pages 431-445
Tilings of the Plane
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (247 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0304-3975(02)00500-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier B.V. All rights reserved.

Data structures and algorithms for tilings I

Olaf Delgado-FriedrichsE-mail The Corresponding Author

Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, D-33501, Bielefeld, Germany

Available online 29 January 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Based on the mathematical theory of Delaney symbols, data structures and algorithms are presented for the analysis and manipulation of generalized periodic tilings in arbitrary dimensions.

Author Keywords: Tiling; Delaney symbol; Symmetry


Theoretical Computer Science
Volume 303, Issues 2-3, 15 July 2003, Pages 431-445
Tilings of the Plane
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.