Definitions from Wikipedia (Rapidly exploring random tree)

▸ noun:  A rapidly exploring random tree is an algorithm designed to efficiently search nonconvex, high-dimensional spaces by randomly building a space-filling tree.


▸ Words similar to rapidly exploring random tree
▸ Usage examples for rapidly exploring random tree

▸ Idioms related to rapidly exploring random tree
▸ Wikipedia articles (New!)
▸ Words that often appear near rapidly exploring random tree
▸ Rhymes of rapidly exploring random tree

▸ Invented words related to rapidly exploring random tree