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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Space-Subdivision Algorithm for Abstract Trajectories


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    01.09.1987



    Medientyp :

    Sonstige


    Format :

    Keine Angabe


    Sprache :

    Englisch




    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 | Europäisches Patentamt | 2021

    Freier Zugriff

    PATH SUBDIVISION DEVICE

    OYAMA TAKAHIRO | Europäisches Patentamt | 2020

    Freier Zugriff