3-D transformations of images in scanline order
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Architectures and algorithms for parallel updates of raster scan displays
Architectures and algorithms for parallel updates of raster scan displays
Odd memory systems may be quite interesting
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Complex Gaussian integers for “Gaussian graphics”
ACM SIGPLAN Notices
Tight bounds for 2-dimensional indexing schemes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient disk allocation for fast similarity searching
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Declustering Objects for Visualization
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
New GDM-Based Declustering Methods for Parallel Range Queries
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Disk Allocation for Fast Range and Nearest-Neighbor Queries
Distributed and Parallel Databases
(Almost) Optimal parallel block access for range queries
Information Sciences—Informatics and Computer Science: An International Journal
Efficient parallel processing of range queries through replicated declustering
Distributed and Parallel Databases
Data space mapping for efficient I/O in large multi-dimensional databases
Information Systems
Optimal interleaving schemes for correcting two-dimensional cluster errors
Discrete Applied Mathematics
Two dimensional range minimum queries and fibonacci lattices
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
A high-resolution raster-graphics display is usually combined with processing power and a memory organization that facilitates basic graphics operations. For many applications, including interactive text processing, the ability to quickly move or copy small rectangles of pixels is essential. This paper proposes a novel organization of raster-graphics memory that permits all small rectangles to be moved efficiently. The memory organization is based on a doubly periodic assignment of pixels to M memory chips according to a “Fibonacci” lattice. The memory organization guarantees that, if a rectilinearly oriented rectangle contains fewer than M/ @@@@5 pixels, then all pixels will reside in different memory chips and thus can be accessed simultaneously. Moreover, any M consecutive pixels, arranged either horizontally or vertically, can be accessed simultaneously.We also define a continuous analog of the problem, which can be posed as: “What is the maximum density of a set of points in the plane such that no two points are contained in the interior of a rectilinearly oriented rectangle of unit area?” We show the existence of such a set with density 1/ @@@@5, and prove this is optimal by giving a matching upper bound.