Linear Quadtree Construction in Real Time
نویسندگان
چکیده
The paper presents a novel method for encoding the linear quadtree of a given image. In this method, the pixels of the image are scanned in row major order. In each encountered pixel, the result codes in the linear quadtree are updated simultaneously in real time. The linear quadtree is thus obtained after all pixels are processed. This method is quite different from those in previous studies, which need huge memory space to store the input pixels for further processing, or need post processing to rearrange the sequence of the final codes to put them back in increasing order. Moreover, since this method adopts simpler and more efficient operations than previous methods, it is found to be faster in experiments.
منابع مشابه
Parallel Processing of Pointer Based Quadtrees on Hypercube Multiprocessors
This paper studies the parallel construction and manipulation of pointer based quadtrees on the hypercube multiprocessor. While parallel algorithms for the manipulation of a variant of linear quadtrees have been previously studied in the literature, no parallel pointer based quadtree construction algorithms have been presented. In this paper, we solve the problem of efficiently constructing poi...
متن کاملParallel Quadtree Construction and Manipulation Algorithms on Hypercubes
In this paper we introduce efficient parallel quadtree construction and manipulation algorithms on hypercube multiprocessors. The notion of extended binomial tree is introduced to represent the distributed quadtree structure on a hypercube. By incorporating the geometric property into the distributed quadtree structure, we devise a data assignment scheme which satisfies the multi-level adjacenc...
متن کاملQuadtree Construction on the GPU: A Hybrid CPU-GPU Approach
We introduce a method for fast quadtree construction on the Graphics Processing Unit (GPU) using a level-by-level approach to quadtree construction. The algorithm is designed to build each subsequent level from the parent nodes of the previous level and thus is suitable for parallelization. Our work is motivated by the use of quadtrees for spactial segmentation of LIDAR data points for grid dig...
متن کاملFast Rendering of Massive Textured Terrain Data
Rendering of textured terrain models has become a widely used technique in the field of GIS applications and virtual reality. In this paper, we propose a framework based on tile-pyramid model and linear quadtree tile-index, which enable the real-time rendering of out-of-core terrain data sets while guaranteeing geometric and texture accuracy. The digital elevation model tile pyramid and the ort...
متن کاملWell Separated Pairs Decomposition
Instead of maintaining such a decomposition explicitly, it is convenient to construct a compressed quadtree T of the points of P , and every pair, (Ai, Bi) is just a pair of nodes (vi, ui) of T , such that Ai = Pvi and Bi = Pui , where Pv denote the points of P stored in the subtree of v, where v is a node of T . This gives us a compact representation of the distances. We slightly modify the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 26 شماره
صفحات -
تاریخ انتشار 2010