Parallel algorithms for planar dominance counting

DOI10.1016/0167-8191(90)90046-CMaRDI QIDQ916374zbMATH OpenOpenAlexFDO

Authors Sung Kwon Kim

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90046-c

zbMATH Keywords

parallel algorithmstime complexity analysisplanar dominance counting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1057777
• Parallel Transitive Closure and Point Location in Planar Structures
• PARALLEL ALGORITHMS FOR SOME DOMINANCE PROBLEMS BASED ON THE PRAM MODEL
• A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
• Optimal randomized parallel algorithms for computational geometry

Cited in

(1)

• A parallel algorithm to construct a dominance graph on nonoverlapping rectangles

This page was built for publication: Parallel algorithms for planar dominance counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916374)