Routing a maximum number of disks through a scene of moving obstacles

DOI10.1145/1377676.1377717MaRDI QIDQ3602923zbMATH OpenOpenAlexFDO

Authors Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Arto Vihavainen

Publication date 12 February 2009

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

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

zbMATH Keywords

algorithmaircraft with safety zonesapplications in air traffic managementcomputation of maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Maximum thick paths in static and dynamic environments
• scientific article; zbMATH DE number 432985
• Routing multi-class traffic flows in the plane
• scientific article; zbMATH DE number 4060716
• Scheduling trajectories on a planar surface with moving obstacles

Cited in

(2)

• Routing multi-class traffic flows in the plane
• Maximum thick paths in static and dynamic environments

This page was built for publication: Routing a maximum number of disks through a scene of moving obstacles

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