The following pages link to Indexing moving points (Q1394801):
Displaying 15 items.
- Out-of-order event processing in kinetic data structures (Q534768) (← links)
- Kinetic sorting and kinetic convex hulls (Q871059) (← links)
- Kinetic facility location (Q970606) (← links)
- How the classical pointer moves (Q1266027) (← links)
- Indexing moving points (Q1394801) (← links)
- Recent progress on selected topics in database research. -- A report by nine young Chinese researchers working in the United States. (Q1412120) (← links)
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) (Q1622346) (← links)
- Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking (Q1783933) (← links)
- Conic nearest neighbor queries and approximate Voronoi diagrams (Q2261577) (← links)
- A simple, faster method for kinetic proximity problems (Q2344057) (← links)
- On repairing and querying inconsistent probabilistic spatio-temporal databases (Q2406905) (← links)
- Maintaining approximate extent measures of moving points (Q2768285) (← links)
- Dimensional Inconsistency Measures and Postulates in Spatio-Temporal Databases (Q5154742) (← links)
- Algorithms – ESA 2004 (Q5464590) (← links)
- Algorithms and Data Structures (Q5900745) (← links)
