Pages that link to "Item:Q1874395"
From MaRDI portal
The following pages link to An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395):
Displaying 8 items.
- Algorithm for finding all \(k\) nearest neighbors (Q628054) (← links)
- The \(k\)-centrum straight-line location problem (Q655169) (← links)
- Fixed-radius near neighbors search (Q1182100) (← links)
- A fast algorithm for \(k\)-nearest neighbor problem on a reconfigurable mesh computer (Q1347716) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- Output-sensitive algorithms for computing nearest-neighbour decision boundaries (Q2484010) (← links)
- THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS (Q4650088) (← links)
- Algorithms and Data Structures (Q5900775) (← links)
