๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Set operations on constant bit-length linear quadtrees

โœ Scribed by Tsong-Wuu Lin

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
999 KB
Volume
30
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

โœฆ Synopsis

The Constant Bit-length Linear Quadtree (CBLQ) is a new encoding scheme for representing binary images. The representation keeps the level of detail property, and it makes the CBLQ suitable for interactive application systems. Based on the CBLQ representation, action tables for set operations are derived. A new algorithm using these derived tables is proposed. The time complexity of the algorithm is linear. A control scheme is also presented to keep the level of detail property in the algorithm. Therefore the algorithm can be used in the interactive application systems.

๐Ÿ“œ SIMILAR VOLUMES

Weighted -approximation with positive li
Weighted -approximation with positive linear operators on unbounded sets
โœ A.D. Gadjiev; A. Aral ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 178 KB

In this work we state and prove a Korovkin type theorem for the weighted space L p,ฯ‰ (R) and also its n-dimensional analogue for the weighted space L p,โ„ฆ (R n ).