Parallelizing an Algorithm for Visibility on Polyhedral Terrain

DOI10.1142/S0218195997000065MaRDI QIDQ4340962zbMATH OpenFDO

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)

zbMATH Keywords

best sequential complexityoutput-sensitive sequential algorithm

Mathematics Subject Classification ID

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

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

Cited in

(5)

• scientific article; zbMATH DE number 278832 (Why is no real title available?)
• An efficient algorithm for the 1D total visibility-index problem
• An efficient algorithm for the 1D total visibility-index problem and its parallelization
• An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
• Solving visibility and separability problems on a mesh-of-processors

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)