𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Data structures and algorithms for tilings I

✍ Scribed by Olaf Delgado-Friedrichs

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
247 KB
Volume
303
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Hierarchical hybrid grids: data structur
Hierarchical hybrid grids: data structures and core algorithms for multigrid
✍ Benjamin Karl Bergen; Frank HΓΌlsemann πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 316 KB

## Abstract For many scientific and engineering applications, it is often desirable to use unstructured grids to represent complex geometries. Unfortunately, the data structures required to represent discretizations on such grids typically result in extremely inefficient performance on current high

The kernel PCA algorithms for wide data.
The kernel PCA algorithms for wide data. Part I: Theory and algorithms
✍ W. Wu; D.L. Massart; S. de Jong πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 590 KB

Four classic PCA algorithms: NIPALS, the power method (POWER), singular value decomposition (SVD) and eigenvalue decomposition (EVD) are modified into their kernel version to analyse wide data sets. For such data sets with many variables and fewer objects, the classic algorithms become very ineffici

Data structure and algorithms for fast a
Data structure and algorithms for fast automatic differentiation
✍ I. Tsukanov; M. Hall πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 425 KB

## Abstract In this paper we discuss the data structure and algorithms for the direct application of generalized Leibnitz rules to the numerical computation of partial derivatives in forward mode. The proposed data structure provides constant time access to the partial derivatives, which accelerate

Data compression for versions of planar
Data compression for versions of planar polygonal tilings
✍ Thomas KΓ€mpke πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 1009 KB

Storage for a series of versions of two-dimensional polygonal tilings is to be minimized by determining a reference and restoring all versions from the reference. Further reduction in storage is achieved by minimizing the storage for the overhead structure which allows the proper reduction. Algorith