The algorithmic beauty of plants
The algorithmic beauty of plants
Cryptanalysis of video encryption based on space-filling curves
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Digital halftoning with space filling curves
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Space diffusion: an improved parallel halftoning technique using space-filling curves
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Texture classification method using multiple space filling curves
Pattern Recognition Letters
Estimation of Generalized Multisensor Hidden Markov Chains and Unsupervised Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Space Filling Curves and Their Use in the Design of Geometric Data Structures
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
A Video Scrambling Technique Based On Space Filling Curves
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Irregularity in multi-dimensional space-filling curves with applications in multimedia databases
Proceedings of the tenth international conference on Information and knowledge management
Parallelizing an Unstructured Grid Generator with a Space-Filling Curve Approach
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Analysis of Multi-Dimensional Space-Filling Curves
Geoinformatica
SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
ACM Transactions on Mathematical Software (TOMS)
Easily-managed and topology-independent location service for self-organizing networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Spatial ordering and encoding for geographic data mining and visualization
Journal of Intelligent Information Systems
A new algorithm for encoding and decoding the Hilbert order
Software—Practice & Experience
Compact Hilbert indices: Space-filling curves for domains with unequal side lengths
Information Processing Letters
An adaptive latency mitigation scheme for massively multiuser virtual environments
Journal of Network and Computer Applications
FPGA placement using space-filling curves: Theory meets practice
ACM Transactions on Embedded Computing Systems (TECS)
Irregularity in high-dimensional space-filling curves
Distributed and Parallel Databases
| Hi-index | 0.00 |
An efficient algorithm for the generation of Hilbert's space-filling curve is given. The algorithm implements a recursive procedure that involves simple integer operations and quickly converges to the set of points that make the Hilbert curve. The algorithm is elegant, short, and considerably easier to implement than previous recursive and nonrecursive algorithms and can be efficiently implemented in all programming languages that have integer operations and allow recursion. The fundamental Hilbert shape (a line joining the four corners of a square) is represented by two variables with values of either 0 or 1. This coding technique could be successfully applied to the generation of other regular space-filling curves, such as the Peano curve.