Indexing moving points

DOI10.1016/S0022-0000(02)00035-1zbMATH Open1026.68143OpenAlexW1979207937MaRDI QIDQ1394801FDOQ1394801

Jeff Erickson, Pankaj K. Agarwal, Lars Arge

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

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

Cites Work

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

Cited In (22)

• Out-of-order event processing in kinetic data structures
• Kinetic facility location
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recent progress on selected topics in database research. -- A report by nine young Chinese researchers working in the United States.
• Title not available (Why is that?)
• How the classical pointer moves
• Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
• Title not available (Why is that?)
• Indexing moving points
• Algorithms – ESA 2004
• Title not available (Why is that?)
• A simple, faster method for kinetic proximity problems
• Kinetic sorting and kinetic convex hulls
• FAST PURSUIT OF MOBILE NODES USING TPR TREES
• Conic nearest neighbor queries and approximate Voronoi diagrams
• Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking
• Dimensional Inconsistency Measures and Postulates in Spatio-Temporal Databases
• Maintaining approximate extent measures of moving points
• On repairing and querying inconsistent probabilistic spatio-temporal databases
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• ArcView

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Proximate point searching 👍 👎

This page was built for publication: Indexing moving points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1394801)