On parallel rectilinear obstacle-avoiding paths (Q1314529): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for String Editing and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel rectilinear shortest paths with rectangular obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear shortest paths in the presence of rectangular barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the X-Y convex hull of a set of X-Y polygons / rank
 
Normal rank

Revision as of 13:06, 22 May 2024

scientific article
Language Label Description Also known as
English
On parallel rectilinear obstacle-avoiding paths
scientific article

    Statements

    On parallel rectilinear obstacle-avoiding paths (English)
    0 references
    0 references
    0 references
    29 November 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    space complexity
    0 references
    processor complexity
    0 references
    query processing
    0 references
    convex polygon
    0 references
    CREW PRAM
    0 references
    data structure
    0 references
    obstacle-avoiding paths
    0 references
    partitioning scheme
    0 references
    recursion tree
    0 references