Routing a maximum number of disks through a scene of moving obstacles (Q3602923)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Routing a maximum number of disks through a scene of moving obstacles |
scientific article; zbMATH DE number 5507874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Routing a maximum number of disks through a scene of moving obstacles |
scientific article; zbMATH DE number 5507874 |
Statements
Routing a maximum number of disks through a scene of moving obstacles (English)
0 references
12 February 2009
0 references
algorithm
0 references
computation of maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane
0 references
applications in air traffic management
0 references
aircraft with safety zones
0 references
0.8743317723274231
0 references
0.7288599610328674
0 references
0.7178207635879517
0 references
