Pages that link to "Item:Q1244819"
From MaRDI portal
The following pages link to The complexity of finding fixed-radius near neighbors (Q1244819):
Displayed 9 items.
- Fixed-radius near neighbors search algorithms for points and segments (Q916423) (← links)
- An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187) (← links)
- A note on the graph isomorphism counting problem (Q1253098) (← links)
- Reporting intersections among thick objects. (Q1853186) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Conformal actions of 𝔰𝔩_{𝔫}(ℝ) and 𝕊𝕃_{𝕟}(ℝ)⋉ℝⁿ on Lorentz manifolds (Q4485718) (← links)
- Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering (Q4513203) (← links)
- TWO-DIMENSIONAL RANGE SEARCH BASED ON THE VORONOI DIAGRAM (Q5311631) (← links)