Pages that link to "Item:Q857064"
From MaRDI portal
The following pages link to Kinetic and dynamic data structures for convex hulls and upper envelopes (Q857064):
Displaying 14 items.
- Out-of-order event processing in kinetic data structures (Q534768) (← links)
- A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
- Kinetic collision detection with fast flight plan changes (Q834964) (← links)
- Kinetic sorting and kinetic convex hulls (Q871059) (← links)
- Kinetic heap-ordered trees: Tight analysis and improved algorithms (Q1853697) (← links)
- Kinetic Euclidean minimum spanning tree in the plane (Q1932347) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- A simple, faster method for kinetic proximity problems (Q2344057) (← links)
- Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model (Q2968093) (← links)
- Kinetic and dynamic data structures for closest pair and all nearest neighbors (Q4962762) (← links)
- (Q5088951) (← links)
- Kinetic data structures for all nearest neighbors and closest pair in the plane (Q5174471) (← links)
- Agglomerative clustering of growing squares (Q5918473) (← links)
- Maintaining the extent of a moving point set (Q5953076) (← links)