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

DOI10.1145/2462356.2462395zbMath1305.68231OpenAlexW2119339514MaRDI QIDQ5174473

Frank Staals, Maarten Löffler, William S. Evans, David G. 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 analysiskinetic datainput imprecision

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)

Related Items (2)

Fréchet Distance for Uncertain Curves ⋮ Minimizing Co-location Potential of Moving Entities

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