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

This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated by applications in air traffic management: aircraft must be routed while avoiding nofly zones and weather constraints and while maintaining at least a specified horizontal separation distance between themselves. Given a polygonal domain with moving obstacles, our goal is to determine the maximum number of unit disks (aircraft with safety zones) that can be routed safely through the domain, entering/exiting through specified edges of the domain. The video is meant to accompany the paper [1], which gives details of the algorithm and its analysis. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--Geometrical problems and computations; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling--Geometric algorithms, languages...

• Type: Conference
• Year: 2008
• Where: COMPGEOM
• Authors: Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Arto Vihavainen
• Keywords: Algorithms, COMPGEOM 2008, Discrete Geometry, Maximum Number, Unit Disks