Computation of Lebesgue’s Space-Filling Curve
Journal Title: Computer Reviews Journal - Year 2019, Vol 4, Issue 0
Abstract
The means of realizing or approximating the Lebesgue space-filling curve (SFC) with binary arithmetic on a uniformly spaced binary grid are not obvious, one problem being its formulation in terms of ternary representations; that impediment can be overcome via use of a binary-oriented Cantor set. A second impediment, namely the Devil’s Staircase feature, also created by the role of the Cantor set, can be overcome via the definition of a “working inverse”, thereby providing means of achieving compatibility with such a grid. The results indicate an alternative way to proceed, in realizing an approximation to Lebesgue’s SFC, which circumvents any complication raised by Cantor sets and is compatible with binary and integer arithmetic. Well-known constructions such as the z-curve or Morton order, sometimes considered in association with Lebesgue’s SFC, are treated as irrelevant.
Authors and Affiliations
Arthur R Butz
A Theoretical Overview of Mobile Networks Environment in Ecuador Prior To 5G
Many countries in the Latin American region experience the technology gap when new technologies are either developing or in testing scenarios. Telecommunications services provider must be encouraged, allowing universal a...
A General Study on Langevin Equations of Arbitrary Order
In this paper, the broad study depends on Langevin differential equations (LDE) of arbitrary order. The fractional order is in terms of ψ-Hilfer fractional operator. This work reveals the dynamical behaviour such as exis...
ARMED for the Mobile Processing War
This article offers an explanation for why the ARM computer architecture won the hearts and minds of the mobile device manufacturers when incumbents like Intel and AMD had such a huge head start and such a large economic...
An Ensemble Model of Machine Learning Algorithms for the Severity of Sickle Cell Disease (Scd) Among Paediatrics Patients
This study was motivated at developing an ensemble of 3 supervised machine learning algorithms for the assessment of the severity of sickle cell disease (SCD) among paediatric patients. The study collected data from a te...
On the Derivation and Analysis of a Highly Efficient Method for the Approximation of Quadratic Riccati Equations
A highly e¢cient method is derived and analyzed in this paper for the approximation of Quadratic Riccati Equations (QREs) using interpolation and collocation procedure. The derivation is carried out within a two-step int...