Pages that link to "Item:Q4226581"
From MaRDI portal
The following pages link to Efficiently computing the closest point to a query line (Q4226581):
Displaying 4 items.
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
