Search results for "Quadtree"
showing 4 items of 4 documents
Efficient Coding of Quadtree Nodes
2006
In this paper an alternative non-pointer quadtree node codification to manage geographical spatial data is presented. New codification is based on a variable sequence of z-ordered base four digits. Memory requirements of the new codification are lower than previous codifications, and in particular lower than FD codification, the most commonly used in linear quadtrees. Furthermore, z-ordering makes compatible new codification with most of the algorithms developed for FD.
The Usage of Quadtree in Deep Neural Networks to Represent Data For Navigation From a Monocular Camera
2022
Depth acquisition represents a key element for navigation tasks. It is, therefore, one of the major research topics in computer vision. Many approaches have been developed to address this problem by constructing the depth from series of images. However, there is a minimal case proposing a prediction from a single image, made possible with the emergence of deep learning approaches. The latter makes it possible to consider a reduction in both hardware and computing time costs, which is beneficial for embedded systems. However, network architecture remains a heavy process requiring a lot of GPU memory. Few approaches have proposed addressing this problem by developing lightweight architectures…
Non-interleaved Quadtree Node Codification
2004
The usual quadtree node non-pointer codification is based on interleaved binary representations of node coordinates, in such a way that every operation that concerns to the spatial position or to the specific orientation of the region represented by the node needs to undo this interleaving process. So, the computation time of such operations is linear with the node depth. In this paper an alternative codification is presented called “non-interleaved codification”. The new codification has a simpler management and a higher intuitiveness than current codifications that use the interleaving approach. The proposed codification is more efficient than previous ones for the following set of operat…
Visualization of Large Terrain Using Non-restricted Quadtree Triangulations
2004
This paper presents a set of new techniques oriented towards the real-time visualization of large terrains. These techniques are mainly focused on semi-regular triangulations of non-restricted quadtree terrain representations. Despite the fact that the paper shows that triangulations based on non-restricted quadtrees are as simple and efficient as those based on restricted quadtrees, the new triangulations avoid discontinuity problems among the boundaries of different patches without the need for tree balancing and extra triangles addition. Another important feature of the proposed triangulation is that it incorporates an efficient method for building triangle strips and triangle fans for t…