2021 2nd International Conference on Big Data and Informatization Education (ICBDIE) 2021
DOI: 10.1109/icbdie52740.2021.00094
|View full text |Cite
|
Sign up to set email alerts
|

Design of nearest neighbor search for dynamic interaction points

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…The closest point search means that a set of points 𝑆 and a target point π‘ž are given in a scale space 𝑀 (π‘ž ∈ 𝑀), and then find the closest point to π‘ž in 𝑆 [21].…”
Section: The Nearest Point Search Algorithmmentioning
confidence: 99%
“…The closest point search means that a set of points 𝑆 and a target point π‘ž are given in a scale space 𝑀 (π‘ž ∈ 𝑀), and then find the closest point to π‘ž in 𝑆 [21].…”
Section: The Nearest Point Search Algorithmmentioning
confidence: 99%