Pages that link to "Item:Q4962762"

The following pages link to Kinetic and dynamic data structures for closest pair and all nearest neighbors (Q4962762):

Displaying 19 items.

• A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
• 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)
• Deferred data structure for the nearest neighbor problem (Q1183453) (← links)
• Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
• Kinetic Euclidean minimum spanning tree in the plane (Q1932347) (← links)
• A simple, faster method for kinetic proximity problems (Q2344057) (← links)
• Kinetic Reverse k-Nearest Neighbor Problem (Q2946067) (← links)
• Kinetic kd-Trees and Longest-Side kd-Trees (Q3586177) (← links)
• Kinetic KD-trees and longest-side KD-trees (Q3602894) (← links)
• Randomized Data Structures for the Dynamic Closest-Pair Problem (Q4210083) (← links)
• Data Structures for Mobile Data (Q4240126) (← links)
• Approximate $k$-Nearest Neighbor Graph on Moving Points (Q5045992) (← links)
• Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
• (Q5136297) (← links)
• Kinetic data structures for all nearest neighbors and closest pair in the plane (Q5174471) (← links)
• A Clustering-Based Approach to Kinetic Closest Pair (Q5369530) (← links)
• Agglomerative clustering of growing squares (Q5918473) (← links)