Indexing moving points

DOI10.1016/S0022-0000(02)00035-1zbMath1026.68143OpenAlexW1979207937MaRDI QIDQ1394801

Jeff Erickson, Lars Arge, Pankaj K. Agarwal

Publication date: 25 June 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(02)00035-1

zbMATH Keywords

indexing schemes

Mathematics Subject Classification ID

Database theory (68P15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Information storage and retrieval of data (68P20)

Related Items (11)

Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) ⋮ Kinetic sorting and kinetic convex hulls ⋮ On repairing and querying inconsistent probabilistic spatio-temporal databases ⋮ Indexing moving points ⋮ Recent progress on selected topics in database research. -- A report by nine young Chinese researchers working in the United States. ⋮ Dimensional Inconsistency Measures and Postulates in Spatio-Temporal Databases ⋮ Out-of-order event processing in kinetic data structures ⋮ Kinetic facility location ⋮ Conic nearest neighbor queries and approximate Voronoi diagrams ⋮ Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking ⋮ A simple, faster method for kinetic proximity problems

Uses Software

• ArcView

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A deterministic view of random sampling and its use in geometry
• The design of dynamic data structures
• Making data structures persistent
• Maintenance of configurations in the plane
• Randomized optimal algorithm for slope selection
• Efficient partition trees
• The complexity of query evaluation in indefinite temporal constraint databases
• Indexing moving points
• Efficient searching with linear constraints
• Applications of random sampling in computational geometry. II
• Indexing for data models with constraints and classes
• Queries on Voronoi diagrams on moving points
• Metric entropy of some classes of sets with differentiable boundaries
• Priority Search Trees
• A Quadtree-Based Dynamic Attribute Indexing Method

This page was built for publication: Indexing moving points