Finding the Convex Hull of Discs in Parallel (Q4513213): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallel computational geometry / 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: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for point-set and polygon problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sublogarithmic convex hull algorithm / 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: Optimal merging and sorting on the EREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex hull algorithm for discs, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound to Finding Convex Hulls / rank
 
Normal rank

Latest revision as of 17:17, 30 May 2024

scientific article; zbMATH DE number 1526811
Language Label Description Also known as
English
Finding the Convex Hull of Discs in Parallel
scientific article; zbMATH DE number 1526811

    Statements