New two-phase spatial data structures with applications to binary images

2003 ◽  
Vol 14 (2) ◽  
pp. 97-113 ◽  
Author(s):  
Kuo-Liang Chung ◽  
Hsu-Lien Huang ◽  
I-Chien Chen
Keyword(s):  
Data Structures ◽  
Spatial Data ◽  
Two Phase ◽  
Binary Images ◽  
Spatial Data Structures

Manipulating images by using Run-length Morton Codes

1997 ◽  
Vol 11 (06) ◽  
pp. 889-907 ◽  
Author(s):  
Chi-Yen Huang ◽  
Kuo-Liang Chung
Keyword(s):  
Data Structures ◽  
Spatial Data ◽  
Efficient Algorithms ◽  
Encoding Scheme ◽  
Run Length ◽  
Binary Images ◽  
Spatial Data Structures ◽  
Set Operations ◽  
Size Number

In this paper, we first present a variation of the 2-dimensional run-encoding, called the run-length Morton code encoding scheme, for compressing binary images, then we present efficient algorithms for manipulating set operations and performing conversions between the proposed encoding scheme and some well-known spatial data structures. The time complexities of set operations are linearly proportional to the size (number) of the run-length Morton codes and the time complexities of conversions are linearly proportional to the number of the nodes in the corresponding quadtree/bintree with respect to the run-length Morton codes.

Interactive Rendering of Indoor and Urban Environments on Handheld Devices by Combining Visibility Algorithms with Spatial Data Structures

2013 ◽  
pp. 341-358
Author(s):  
Wendel B. Silva ◽  
Maria Andréia F. Rodrigues
Keyword(s):  
Data Structures ◽  
Spatial Data ◽  
Urban Environments ◽  
Handheld Devices ◽  
Mobile Platforms ◽  
Spatial Data Structures ◽  
Uniform Grids ◽  
3D Environments ◽  
View Frustum Culling ◽  
Graphics Rendering

This work presents a comparative study of various combinations of visibility algorithms (view-frustum culling, backface culling, and a simple yet fast algorithm called conservative backface culling) and different settings of standard spatial data structures (non-uniform Grids, BSP-Trees, Octrees, and Portal-Octrees) for enabling efficient graphics rendering of both indoor and urban 3D environments, especially suited for low-end handheld devices. Performance tests and analyses were conducted using two different mobile platforms and environments in the order of thousands of triangles. The authors demonstrate that navigation at interactive frame rates can be obtained using geometry rather than image-based rendering or point-based rendering on the cell phone Nokia n82.

scholarly journals I/O-efficient spatial data structures for range queries

2012 ◽  
Vol 4 (2) ◽  
pp. 2-7 ◽  
Author(s):  
Lars Arge ◽  
Kasper Green Larsen
Keyword(s):  
Data Structures ◽  
Spatial Data ◽  
Range Queries ◽  
Spatial Data Structures
Sign in / Sign up

Export Citation Format

Share Document