On filling space with different integer cubes
نویسندگان
چکیده
منابع مشابه
Sixteen space-filling curves and traversals for d-dimensional cubes and simplices
This article describes sixteen different ways to traverse d-dimensional space recursively in a way that is well-defined for any number of dimensions. Each of these traversals has distinct properties that may be beneficial for certain applications. Some of the traversals are novel, some have been known in principle but had not been described adequately for any number of dimensions, some of the t...
متن کاملNumerical Investigation on Asymmetric Bilayer System at Integer Filling Factor
Deformation of the easy-axis ferromagnetic state in asymmetric bilayer systems are investigated numerically. Using the exact diagonalization the easy-axis to easy-plane ferromagnetic transition at total filling factor 3 or 4 is investigated. At still higher filling, novel stripe state in which stripes are aligned in the vertical direction occurs. The Hartree-Fock energies of relevant ordered st...
متن کاملPartitioning with Space-Filling Curves on the Cubed-Sphere
Numerical methods for solving the systems of partial differential equations arising in geophysical fluid dynamics rely on a variety of spatial discretization schemes (e.g. finite difference, finite element). For parallel execution on distributed memory computers, the computational domain must be partitioned. The choice of partitioning algorithm can have a significant impact on the sustained flo...
متن کاملNeighbor-finding based on space-filling curves
Nearest neighbor-finding is one of the most important spatial operations in the field of spatial data structures concerned with proximity. Because the goal of the space-filling curves is to preserve the spatial proximity, the nearest neighbor queries can be handled by these space-filling curves. When data is ordered by the Peano curve, we can directly compute the sequence numbers of the neighbo...
متن کاملEfficient Neighbor-Finding on Space-Filling Curves
Space-filling curves (SFC, also known as FASS-curves) are a useful tool in scientific computing and other areas of computer science to sequentialize multidimensional grids in a cache-efficient and parallelization-friendly way for storage in an array. Many algorithms, for example grid-based numerical PDE solvers, have to access all neighbor cells of each grid cell during a grid traversal. While ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1984
ISSN: 0097-3165
DOI: 10.1016/0097-3165(84)90007-4