NASA NTRS · 19870000437
Space-Subdivision Algorithm for Abstract Trajectories
Abstract
Computational overhead in testing links between nodes reduced. Computationally efficient algorithm facilitates subdivision of n-dimensional spaces during selection, testing, or optimization of trajectories in those spaces. Reduces cost of computation in such diverse problems as scheduling of interrelated events to avoid conflicts, devising efficient production-line layouts and operating schedules, routing telephone calls, and analyzing the motions of gas particles.
Keep this discovery
Explore connections, maps & timelines
Lyon, Douglas K.. 1987-09-01. Space-Subdivision Algorithm for Abstract Trajectories. https://engineeringpapers.com/record/nasa%3A19870000437/space-subdivision-algorithm-for-abstract-trajectories
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.