An effective way to represent quadtrees
From MaRDI portal
Cited in
(23)- Properties and applications of forests of quadtrees for pictorial data representation
- On the size of quadtrees generalized to d-dimensional binary pictures
- Digitizing the plane with cells of nonuniform size
- Detection of connectivity for regions represented by linear quadtrees
- Octree representation and its applications in CAD
- A quadtree algorithm for template matching on a pyramid computer
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
- Quadtree-polygonal smoothed finite element method for adaptive brittle fracture problems
- Faster compressed quadtrees
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- Novel quadtree algorithm for adaptive analysis based on cell-based smoothed finite element method
- POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
- Constructing a high-dimensional kNN-graph using a Z-order curve
- On Locality-Sensitive Orderings and Their Applications
- Path-controlled graph grammars for multiresolution image processing and analysis
- A Wavelet-Adaptive Method for Multiscale Simulation of Turbulent Flows in Flying Insects
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
- Fast high-dimensional approximation with sparse occupancy trees
- Determination of the 3D border by repeated elimination of internal surfaces
- Linear quadtrees: A blocking technique for contour filling
- Comments on Detection of connectivity for regions represented by linear quadtrees
- Secondary attribute retrieval using tree data structures
This page was built for publication: An effective way to represent quadtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4741725)
