Skip to search formSkip to main contentSkip to account menu

R* tree

Known as: R*-tree, R*tree 
R*-trees are a variant of R-trees used for indexing spatial information. R*-trees have slightly higher construction cost than standard R-trees, as… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
For operations in the Arctic, drift ice can be a major hazard. To be able to mitigate this, it is essential to know the position… 
2010
2010
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P… 
2010
2010
Multidimensional point indexing plays a critical role in a variety of data-centric applications, including image retrieval… 
2003
2003
It has been found that the technique of searching for similar patterns among time series data is very important in a wide range… 
Review
2002
Review
2002
Collision detection is an important component of many applications in computer graphics applications. In particular, it is a… 
2001
2001
Many applications require that large amounts of data are deleted from a database - typically, such bulk deletes are carried out… 
Highly Cited
2001
Highly Cited
2001
A box-tree is a bounding-volume hierarchy that uses axis-aligned boxes as bounding volumes. The query complexity of a box-tree… 
2001
2001
L'objectif des bases de donnees de champs continus est la representation des phenomenes continus (meteorologie, geologie… 
Highly Cited
1998
Highly Cited
1998
CM-line loading of R-trees is useful to improve node utilization and query performance. WTepresent an algorithm for bulk loading… 
Highly Cited
1993
Highly Cited
1993
Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems…