Minimizing co-location potential of moving entities
From MaRDI portal
Publication:2829447
DOI10.1137/15M1031217zbMATH Open1353.68123OpenAlexW2533806635MaRDI QIDQ2829447FDOQ2829447
Frank Staals, W. Evans, David Kirkpatrick, Maarten Löffler
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
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
- Deformable spanners and applications
- Separators for sphere-packings and nearest neighbor graphs
- Efficient update strategies for geometric computing with uncertainty
- A study on two geometric location problems
- Largest and smallest convex hulls for imprecise points
- A computational framework for incremental motion
- A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Kinetic convex hulls and delaunay triangulations in the black-box model
- Input-Thrifty Extrema Testing
- Maintaining Nets and Net Trees under Incremental Motion
- 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
Cited In (3)
This page was built for publication: Minimizing co-location potential of moving entities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829447)
