Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries

  title={Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries},
  author={Jonathan B. Rosenberg},
  journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  • J. Rosenberg
  • Published 1985
  • Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
This paper compares three data structures that support area operations on 2-space: linked lists, quad trees, and multidimensional binary trees (k-d trees). Region searching is the most important operation these data structures must support in many applications. Insertion and deletion must also be reasonably fast. The three data structures are described and implementation considerations are discussed. Extensive experimentation was done using an experimental program that executed algorithms for… 
Efficient geographic information systems: Data structures, Boolean operations and concurrency control
This thesis presents a generalized solution that could significantly improve the time performance of evaluating complex boolean operation queries and presents algorithms to enable concurrent access to R-tree spatial data structures so that efficient sharing of geographic data can occur in a multi user GIS environment.
Definitions of Line-Line Relations for Geographic Databases
The main goal of the spatial query processor is to reduce expensive steps by preprocessing operations in the preceding steps which reduce the number of objects investigated in an expensive step.
A parallel data distribution management algorithm
The results show that the sequential implementation of ITM is competitive with sort-based matching, and the parallel implementation provides good speed upon multicore processors.
A new plane-sweep algorithm based on spatial data structure for overlapped rectangles in 2-D plane
  • P.-Y. Hsiao, Chia-Chun Tsai
  • Computer Science
    Proceedings., Fourteenth Annual International Computer Software and Applications Conference
  • 1990
A novel plane-sweep algorithm based on spatial data structures with region query operations with a computing time of O(N log N) that has been successfully implemented in C language and applied to problems of layout compaction, design rule checking, and minimum reliable partition.
External segment trees
This paper transfers the underlying principle of the segment tree in a nontrivial way to secondary storage and arrives at the EST-an external file structure with the same functionality and the following properties: the EST is balanced and the update algorithms are efficient.
A distributed KD-Tree (DKD-Tree) suitbable for polygon data, and a two-step query algorithm based on k-d tree that not only greatly improves the efficiency of spatial region query, but also has good scalability.
HV/VH Trees: A New Spatial Data Structure for Fast Region Queries
This paper explodes the myth that bisector lists imply slow region queries by introducing a new data structure, HV/VH trees, which is as fast as or faster than kD trees and two improved forms of quad trees on region queries performed on data from real VLSI designs.
A sweeping line algorithm based on two dimensional region search
A theorem proves that the presented plane-sweep algorithm can be built from any spatial data structure with region query functions, and can be performed in a time complexity of O(N log N).
Nearly Balanced Quad List Quad Tree -A Data Structure for VLSI Layout Systems*
This paper presents a new division method to reconstruct those quad trees including the multiple storage quad tree (MSQT) and the quad list quad Tree (QLQT), and demonstrates that the improvement in region queries of the presented nearly balanced quad trees is better than the improvement of the QLQT to the MSQT.
Comparisons of quad trees and 4-D trees: new results [VLSI layout]
It is shown that quad trees without bisector lists, for some small threshold values, have a better speed and require less storage than four-dimensional trees.


The quad-cif tree a data structure for h
The quad-CIF tree data structure is described and it is outlined how one can use the data structure in order to implement hierarchical, on-line design rule checking and node extraction.
Multidimensional binary search trees used for associative searching
The multidimensional binary search tree (or <italic>k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools
  • J. Ousterhout
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1984
The algorithms are presented under a simplified model of VLSI circuits, and the storage requirements of the structure are discussed.
Stresses in local oxidation
This paper presents simulations of LOCOS oxide shapes as well as calculations of stresses during oxidations by using a two-dimensional oxidation model based on a slow incompressible viscous flow.
A Viscous Flow Model to Explain the Appearance of High Density Thermal SiO2 at Low Oxidation Temperatures
Higher density results from the thermal oxidation of Si in dry at lower oxidation temperatures. More than 3% higher density is observed for grown at 600°C as compared with 1150°C. A consistent model
Stress in thermal SiO2 during growth
Stress present in thermal SiO2 at temperatures during growth in wet O2 has been measured as a function of growth temperature. During growth at 950 °C and below, compressive stress on the order of