Rapid Display Method of Massive Data Based on Intelligent Clustering Model

In order to display three-dimensional massive data in real time,this paper proposes an improved rapid display algorithm for massive data.The CURE clustering algorithm is used to sort the data,and the data is indexed by Hilbert R-tree.The visual area prediction model predicts the next time visible ar...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Ji suan ji gong cheng Ročník 45; číslo 8; s. 53 - 59
Hlavní autor: TANG Hongcheng, WEN Chang, FENG Wenxiang, XIE Kai, FANG Wenqing
Médium: Journal Article
Jazyk:čínština
angličtina
Vydáno: Editorial Office of Computer Engineering 01.08.2019
Témata:
massive data|hilbert r-tree|forecasting model|clustering algorithm|load in advance algorithm
ISSN:1000-3428
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In order to display three-dimensional massive data in real time,this paper proposes an improved rapid display algorithm for massive data.The CURE clustering algorithm is used to sort the data,and the data is indexed by Hilbert R-tree.The visual area prediction model predicts the next time visible area to realize rapid visualization of large amounts of data.Experimental results show that compared with the Visualization algorithm based on Motion of Viewpoint (VMV) and the Visualization algorithm based on Testing of Visibility (VTV),the rendering speed is 18.27% higher than the VMV algorithm without reducing the rendering quality.Compared with the VTV algorithm,the increase is 67.06%,the prediction area error rate is reduced by 9.73% compared with the VMV algorithm,and the VTV algorithm is reduced by 22.37%,which can quickly load data and accurately draw three-dimensional large data volume.
ISSN:1000-3428
DOI:10.19678/j.issn.1000-3428.0052493