Abstract
Searching and handling geometric data are basic requirements of any Computer Aided Engineering application (CAE). Spatial search and local search has greater importance in CAD and CAE applications for reducing the model preparation time. There are many efficient algorithms being made to search geometrical data. Current neighbour search strategy is limited and not efficient in different CAE platforms. R-tree is tree data structure used for spatial access methods. This paper presents a review of R-tree data structure with its implementation in one of the CAE tool for neighbour search and local search. It satisfies current neighbour search requirements in CAE tools. Results shows considerable amount of time saving compared to the conventional approach. This work concludes that R-tree implementation can be helpful in identifying neighbour part and reducing model preparation time in CAD and CAE tools.
Subject
Control and Optimization,Modelling and Simulation
Reference8 articles.
1. Sheen D.-P., Son T.-G., Dimension Reduction of Solid Models by Mid-Surface Generation, 2008
2. Guttman A., R-trees: a dynamic index structure for spatial searching, in: Proceedings ACM SIGMOD Conference, Boston, MA, 1984, pp. 47–57
3. Roussopoulos N., Kelley S., Vincent F.. Nearest neighbor queries, in: Proceedings ACM SIGMOD Conference, San Jose, CA, 1995, pp. 71–79
4. Manolopoulos Y., R-trees have grown everywhere, 2013
5. Ahn H.K., Mamoulis N., Wong H.M., A Survey on multidimensional access methods, 2013
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献