Optimal parallel algorithms for point-set and polygon problems (Q1187196): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Richard John Cole / rank
Normal rank
 
Property / author
 
Property / author: Richard John Cole / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computational geometry / 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: Parallel algorithms for some functions of two convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on the all nearest-neighbor problem for convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the convex hull of a sorted point set in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a polygon in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all nearest-neighbor problem for convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Finding the Kernel of a Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the intersection of n half-spaces in time O(n log n) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the all nearest-neighbor problem for convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel triangulation of a polygon in two calls to the trapezoidal map / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:29, 15 May 2024

scientific article
Language Label Description Also known as
English
Optimal parallel algorithms for point-set and polygon problems
scientific article

    Statements

    Optimal parallel algorithms for point-set and polygon problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    0 references
    kernel problem
    0 references
    convex hull
    0 references
    point sets
    0 references
    polygons
    0 references
    EREW PRAM
    0 references
    CREW PRAM
    0 references
    nearest-neighbor problems
    0 references