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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Space-Subdivision Algorithm for Abstract Trajectories


    Contributors:

    Published in:

    Publication date :

    1987-09-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English




    Fast Binary Dilation/Erosion Algorithm Using Kernel Subdivision

    Narayanan, A. | British Library Conference Proceedings | 2006


    Optimal Space Trajectories

    Bell, David John | TIBKAT | 1970


    Optimal Space Trajectories

    T. N. Edelbaum | NTIS | 1969


    ROUTE SUBDIVISION APPARATUS

    OYAMA TAKAHIRO | European Patent Office | 2021

    Free access

    PATH SUBDIVISION DEVICE

    OYAMA TAKAHIRO | European Patent Office | 2020

    Free access