Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC (Q5221383)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC |
scientific article; zbMATH DE number 7182249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC |
scientific article; zbMATH DE number 7182249 |
Statements
Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC (English)
0 references
25 March 2020
0 references
explicit model predictive control
0 references
point location
0 references
binary search tree
0 references
\(k\)-\(d\) tree
0 references
grid \(k\)-\(d\) tree
0 references
0 references
0.88912797
0 references
0.8390684
0 references
0.8332745
0 references
0.8248767
0 references
0.8239196
0 references
0.82215846
0 references
0.82118833
0 references
0.81872296
0 references
0.81872296
0 references
0.81862706
0 references
