2007
DOI: 10.1016/j.infsof.2006.09.005
|View full text |Cite
|
Sign up to set email alerts
|

A new indexing method with high storage utilization and retrieval efficiency for large spatial databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…The core of 3D model data organisation is the 3D spatial index taking into account the LOD. Common index structures include binary space partitioning, K-tree, bounding volume hierarchies, grid partitioning, quadtree, octree, R-tree etc [11][12][13][14][15]. The nodes of the R-tree usually represent bounding boxes, which are used to organise and manage spatial objects.…”
Section: Introductionmentioning
confidence: 99%
“…The core of 3D model data organisation is the 3D spatial index taking into account the LOD. Common index structures include binary space partitioning, K-tree, bounding volume hierarchies, grid partitioning, quadtree, octree, R-tree etc [11][12][13][14][15]. The nodes of the R-tree usually represent bounding boxes, which are used to organise and manage spatial objects.…”
Section: Introductionmentioning
confidence: 99%