Minimizing Co-location Potential of Moving Entities

DOI10.1137/15M1031217zbMath1353.68123OpenAlexW2533806635MaRDI QIDQ2829447

Frank Staals, Maarten Löffler, William S. Evans, David G. Kirkpatrick

Publication date: 28 October 2016

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1031217

zbMATH Keywords

competitive analysisdata in motioninput impressionply

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Efficient update strategies for geometric computing with uncertainty
• Largest and smallest convex hulls for imprecise points
• A study on two geometric location problems
• Deformable spanners and applications
• Input-Thrifty Extrema Testing
• Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
• Maintaining Nets and Net Trees under Incremental Motion
• A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
• Separators for sphere-packings and nearest neighbor graphs
• Competitive query strategies for minimising the ply of the potential locations of moving points
• Tracking Moving Objects with Few Handovers
• Kinetic connectivity for unit disks
• A computational framework for incremental motion
• Kinetic convex hulls and delaunay triangulations in the black-box model