2020
DOI: 10.1007/s12517-020-05752-6
|View full text |Cite
|
Sign up to set email alerts
|

Geological tetrahedral model-oriented hybrid spatial indexing structure based on Octree and 3D R*-tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 23 publications
0
6
0
Order By: Relevance
“…To overcome the shortcoming of single index methods, more and more scholars try to design hybrid index technology. Some proposed strategies are combining with different index structures organically and achieve a better performance in query operation [9,11,[16][17][18][19].…”
Section: Hybrid Indexing Structurementioning
confidence: 99%
See 1 more Smart Citation
“…To overcome the shortcoming of single index methods, more and more scholars try to design hybrid index technology. Some proposed strategies are combining with different index structures organically and achieve a better performance in query operation [9,11,[16][17][18][19].…”
Section: Hybrid Indexing Structurementioning
confidence: 99%
“…So, many hybrid index methods are proposed in recent years. Such as combining 3D R*-tree and kd-tree [18], octree and 3D R*-tree [19], quad-tree and 3D R-tree [31], kd-tree and octree [11], octree and kd-tree [3,34], quad-tree and octree [35], etc. The main idea is to improve the imbalance of tree and speed up the query operation.…”
Section: D R*-treementioning
confidence: 99%
“…The first aspect is the 3D geologic model building algorithm. Traditional 3D geological models can be classified into the octree model (Wang et al, 2020), triangular prism (Zhang et al, 2015), TEN model (He et al, 2022), and TIN model (Ouyang et al, 2023). In addition, among the equivalence surface algorithms are the Cuberille algorithm proposed by Herman and Liu (1979), the Marching cube algorithm proposed by Lorensen and Cline (1987), and the decomposition cube method proposed by Cline et al (1988).…”
Section: Introductionmentioning
confidence: 99%
“…Our objective is to support arbitrary geospatial partitioning algorithms, which can handle the needs of applications that require different levels of granularity in terms of location reporting. Spatial indexing [9,31,32] is a common approach used for partitioning, and numerous techniques have been proposed that partition the data domain according to varying criteria, such as area, perimeter, data point count, etc. We build upon existing spatial indexing techniques, and adapt the partition criteria to account for the specific goals of fairness.…”
Section: Introductionmentioning
confidence: 99%