Parallelizing an Algorithm for Visibility on Polyhedral Terrain

DOI10.1142/S0218195997000065zbMATH Open0877.68112MaRDI QIDQ4340962FDOQ4340962

Authors: Y. Ansel Teng, David M. Mount, Enrico Puppo, Larry S. Davis 

Publication date: 27 July 1997

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• An optimal parallel algorithm for the visibility of a simple polygon from a point
• An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
• Parallel methods for visibility and shortest-path problems in simple polygons
• An efficient algorithm for the 1D total visibility-index problem and its parallelization

zbMATH Keywords

best sequential complexityoutput-sensitive sequential algorithm

Mathematics Subject Classification ID

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

Cited In (5)

• An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
• Solving visibility and separability problems on a mesh-of-processors
• An efficient algorithm for the 1D total visibility-index problem
• Title not available (Why is that?)
• An efficient algorithm for the 1D total visibility-index problem and its parallelization

This page was built for publication: Parallelizing an Algorithm for Visibility on Polyhedral Terrain

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