Coarse-grained parallel geometric search

DOI10.1006/JPDC.1998.1527MaRDI QIDQ1291017zbMATH OpenOpenAlexFDO

Authors K. Appert, Albert M. Chan, Frank Dehne, Andrew Rau-Chaplin

Publication date 3 June 1999

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c0bb742f233baa72e4020febc77543a159f39d4d

zbMATH Keywords

coarse grained multicomputer

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The complexity of parallel multisearch on coarse-grained machines
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
• Parallel geometric algorithms in coarse-grain network models
• d-dimensional range search on multicomputers

Cited in

(7)

• The complexity of parallel multisearch on coarse-grained machines
• An architecture independent study of parallel segment trees
• Parallel geometric algorithms in coarse-grain network models
• Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
• Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers
• Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
• Pipelined search on coarse grained networks

This page was built for publication: Coarse-grained parallel geometric search

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