✦ LIBER ✦

Table-driven algorithms for generating space-filling curves

✍ Scribed by J.G. Griffiths

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 438 KB
Volume: 17
Category: Article
ISSN: 0010-4485
DOI: 10.1016/0010-4485(85)90009-0

No coin nor oath required. For personal study only.

✦ Synopsis

A simple general method for constructing space-filling curves is presented, based on the use of tables. It is shown how the use of Hilbert's curve can enhance the performance of Warnock's algorithm. A procedure is given which generates Hilbert curves or Sierpinski curves. A second procedure is given which generates Warnock 's windows in Hilbert order.

📜 SIMILAR VOLUMES

Parallel space-filling curve generation

Parallel space-filling curve generation through sorting

✍ J. Luitjens; M. Berzins; T. Henderson 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

Applications of the space — filling curv

Applications of the space — filling curves with data driven measure — preserving property

✍ Ewa Skubalska-Rafajłowicz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Clustering algorithm using space filling

Clustering algorithm using space filling curves for the classification of high energy physics data

✍ Mostafa Mjahed 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 278 KB

According to a space filling curve, distances between points in a multidimensional space are replaced by distances along a Lebesgue measure-preserving curve. By using a neighbouring approach on the space filling curve, several clusters may emerge fkom data and configurations may be associated to the

An algorithm for high-speed curve genera

An algorithm for high-speed curve generation

✍ George Merrill Chaikin 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 182 KB

A general algorithm for determining stat

A general algorithm for determining state-space representations

✍ W.A. Wolovich; R. Guidorzi 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 361 KB

A new and direct procedure is presented for determining state-space representations of given, time-invariant systems whose dynamical behavior is expressed in a more general, differential operator form. The procedure employs some preliminary polynomial matrix operations, if necessary, in order to "re

A subdivision algorithm for generalized

A subdivision algorithm for generalized Bernstein–Bézier curves

✍ M.K. Jena; P. Shunmugaraj; P.C. Das 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 394 KB

In this article we present a computationally efficient subdivision algorithm for the evaluation of generalized Bernstein-Bézier curves. As particular cases we have subdivision algorithms for classical as well as trigonometric Bernstein-Bézier curves.