Competitive query strategies for minimising the ply of the potential locations of moving points

DOI10.1145/2462356.2462395MaRDI QIDQ5174473zbMATH OpenOpenAlexFDO

Authors Maarten Löffler, Frank Staals, W. Evans, David Kirkpatrick

Publication date 17 February 2015

Published in Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2462356.2462395

zbMATH Keywords

competitive analysisinput imprecisionkinetic data

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Recommendations

• Dynamic planar point location with optimal query time (extended abstract)
• Dynamic planar point location with optimal query time
• Algorithms – ESA 2004
• Dynamic planar point location in optimal time
• Randomized vs. deterministic distance query strategies for point location on the line
• Competitive searching in polygons—Beyond generalised streets
• A space-efficient framework for dynamic point location
• A robust and efficient algorithm for planar competitive location problems

Cited in

(7)

• Minimizing co-location potential of moving entities
• Tracking moving objects with few handovers
• Fréchet Distance for Uncertain Curves
• Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
• Minimizing the size of the uncertainty regions for centers of moving entities
• Perpetual scheduling with explorable uncertainty
• Frequency-competitive query strategies to maintain low congestion potential among moving entities

This page was built for publication: Competitive query strategies for minimising the ply of the potential locations of moving points

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