Advanced indexing methods for large spatial data in complex dynamic scenes

This paper is dedicated to review of recent methods for indexing of multidimensional data and their use for modeling of large-scale dynamic scenes. The problem arises in many application domains such as computer graphics systems, virtual and augmented reality systems, CAD systems, robotics, geograph...

Full description

Bibliographic Details
Main Authors: V. A. Zolotov, V. A. Semenov
Format: Article
Language:English
Published: Ivannikov Institute for System Programming of the Russian Academy of Sciences 2018-10-01
Series:Труды Института системного программирования РАН
Subjects:
Online Access:https://ispranproceedings.elpub.ru/jour/article/view/964
id doaj-54c39cace92f4d3e923e2a25c870a6a4
record_format Article
spelling doaj-54c39cace92f4d3e923e2a25c870a6a42020-11-25T00:49:14Zeng Ivannikov Institute for System Programming of the Russian Academy of SciencesТруды Института системного программирования РАН2079-81562220-64262018-10-01240964Advanced indexing methods for large spatial data in complex dynamic scenesV. A. Zolotov0V. A. Semenov1ИСП РАНИСП РАНThis paper is dedicated to review of recent methods for indexing of multidimensional data and their use for modeling of large-scale dynamic scenes. The problem arises in many application domains such as computer graphics systems, virtual and augmented reality systems, CAD systems, robotics, geographical information systems, project management systems, etc. Two fundamental approaches to the indexing of multidimensional data, namely object aggregation and spatial decomposition, have been outlined. In the context of the former approach balanced search trees, also referred as object pyramids, have been discussed. In particular, generalizations of B-trees such as R-trees, R*-trees, R+-trees have been discussed in conformity to indexing of large data located in external memory and accessible by pages. The conducted analysis shows that object aggregation methods are well suited for static scenes but very limited for dynamic environments. The latter approach assumes the recursive decomposition of scene volume in accordance with the cutting rules. Space decomposition methods are octrees, A-trees, bintrees, K-D-trees, X-Y-trees, treemaps and puzzle-trees. They support more reasonable compromise between performance of spatial queries and expenses required to update indexing structures and to keep their in concordant state under permanent changes in the scenes. Compared to object pyramids, these methods look more promising for dramatically changed environments. It is concluded that regular dynamic octrees are most effective for the considered applications of modeling of large-scale dynamic scenes.https://ispranproceedings.elpub.ru/jour/article/view/964spatial indexing, multidimensional data, dynamic scene modeling
collection DOAJ
language English
format Article
sources DOAJ
author V. A. Zolotov
V. A. Semenov
spellingShingle V. A. Zolotov
V. A. Semenov
Advanced indexing methods for large spatial data in complex dynamic scenes
Труды Института системного программирования РАН
spatial indexing, multidimensional data, dynamic scene modeling
author_facet V. A. Zolotov
V. A. Semenov
author_sort V. A. Zolotov
title Advanced indexing methods for large spatial data in complex dynamic scenes
title_short Advanced indexing methods for large spatial data in complex dynamic scenes
title_full Advanced indexing methods for large spatial data in complex dynamic scenes
title_fullStr Advanced indexing methods for large spatial data in complex dynamic scenes
title_full_unstemmed Advanced indexing methods for large spatial data in complex dynamic scenes
title_sort advanced indexing methods for large spatial data in complex dynamic scenes
publisher Ivannikov Institute for System Programming of the Russian Academy of Sciences
series Труды Института системного программирования РАН
issn 2079-8156
2220-6426
publishDate 2018-10-01
description This paper is dedicated to review of recent methods for indexing of multidimensional data and their use for modeling of large-scale dynamic scenes. The problem arises in many application domains such as computer graphics systems, virtual and augmented reality systems, CAD systems, robotics, geographical information systems, project management systems, etc. Two fundamental approaches to the indexing of multidimensional data, namely object aggregation and spatial decomposition, have been outlined. In the context of the former approach balanced search trees, also referred as object pyramids, have been discussed. In particular, generalizations of B-trees such as R-trees, R*-trees, R+-trees have been discussed in conformity to indexing of large data located in external memory and accessible by pages. The conducted analysis shows that object aggregation methods are well suited for static scenes but very limited for dynamic environments. The latter approach assumes the recursive decomposition of scene volume in accordance with the cutting rules. Space decomposition methods are octrees, A-trees, bintrees, K-D-trees, X-Y-trees, treemaps and puzzle-trees. They support more reasonable compromise between performance of spatial queries and expenses required to update indexing structures and to keep their in concordant state under permanent changes in the scenes. Compared to object pyramids, these methods look more promising for dramatically changed environments. It is concluded that regular dynamic octrees are most effective for the considered applications of modeling of large-scale dynamic scenes.
topic spatial indexing, multidimensional data, dynamic scene modeling
url https://ispranproceedings.elpub.ru/jour/article/view/964
work_keys_str_mv AT vazolotov advancedindexingmethodsforlargespatialdataincomplexdynamicscenes
AT vasemenov advancedindexingmethodsforlargespatialdataincomplexdynamicscenes
_version_ 1725252291586424832