Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC

Research article (International Journal of Control, 2018) · cited 10× · AI/ML

academia openalex:W2811139923

Press Enter · cited answer in seconds

Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC

Summary

Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC is a scholarly article^[1].

Key Facts

Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC's instance of is recorded as scholarly article^[2].

⭐ Popularity Graph

0/100 long tail

Quick Facts

Instance of scholarly article

🔗 Connections

Authored by 1

Xiaojie Xiu

← Author of 1

Xiaojie Xiu

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

[2] ↑ Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC is an instance of scholarly article (scholarly article) [P31, primary]. Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA

4ort.xyz Knowledge Graph. (2026). Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC. Retrieved May 24, 2026, from https://4ort.xyz/entity/grid-k-d-tree-approach-for-point-location-in-polyhedral-data-sets-application-to-explicit-mpc

MLA

“Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/grid-k-d-tree-approach-for-point-location-in-polyhedral-data-sets-application-to-explicit-mpc.

BibTeX

@misc{4ortxyz_grid-k-d-tree-approach-for-point-location-in-polyhedral-data-sets-application-to-explicit-mpc_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC}}, year = {2026}, url = {https://4ort.xyz/entity/grid-k-d-tree-approach-for-point-location-in-polyhedral-data-sets-application-to-explicit-mpc}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC — https://4ort.xyz/entity/grid-k-d-tree-approach-for-point-location-in-polyhedral-data-sets-application-to-explicit-mpc (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/grid-k-d-tree-approach-for-point-location-in-polyhedral-data-sets-application-to-explicit-mpc · Last refreshed: May 24, 2026