Pages that link to "Item:Q2344057"
From MaRDI portal
The following pages link to A simple, faster method for kinetic proximity problems (Q2344057):
Displaying 6 items.
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- A clustering-based approach to kinetic closest pair (Q722518) (← links)
- Stable Delaunay graphs (Q908210) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- Kinetic Reverse k-Nearest Neighbor Problem (Q2946067) (← links)
- Approximate $k$-Nearest Neighbor Graph on Moving Points (Q5045992) (← links)
