Pages that link to "Item:Q4818603"
From MaRDI portal
The following pages link to COMPUTING CLOSEST POINTS FOR SEGMENTS (Q4818603):
Displayed 3 items.
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- Computing closest and farthest points for a query segment (Q2481974) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)