The following pages link to (Q5501855):
Displayed 17 items.
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Indexing moving points (Q1394801) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) (Q1622346) (← links)
- Kinetic Euclidean minimum spanning tree in the plane (Q1932347) (← links)
- Nonuniform SINR+Voronoi diagrams are effectively uniform (Q2043011) (← links)
- A simple, faster method for kinetic proximity problems (Q2344057) (← links)
- A package for exact kinetic data structures and sweepline algorithms (Q2371341) (← links)
- On incremental rendering of silhouette maps of a polyhedral scene (Q2385692) (← links)
- The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets (Q3612833) (← links)
- Kinetic Polar Diagram (Q3628489) (← links)
- Dynamic proximity calculations for situation awareness (Q4651716) (← links)
- Approximate $k$-Nearest Neighbor Graph on Moving Points (Q5045992) (← links)
- Maintaining the extent of a moving point set (Q5096923) (← links)
- (Q5111721) (← links)
- (Q5136247) (← links)