scientific article; zbMATH DE number 645774

MaRDI QIDQ4307488zbMATH OpenFDO

Authors

Publication date 28 September 1994

zbMATH Keywords

complexity class \(NC\)computer graphicshidden-line problemmodel of parallel computationparallel algorithmsparallel complexityvisibility

Mathematics Subject Classification ID

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

Recommendations

• A worst-case efficient algorithm for hidden-line elimination^†
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• Solving visibility and separability problems on a mesh-of-processors
• A linear algorithm for eliminating hidden-lines from a polygonal cylinder
• scientific article; zbMATH DE number 4050999

Cited in

(6)

• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
• scientific article; zbMATH DE number 4050999 (Why is no real title available?)
• New algorithms for special cases of the hidden line elimination problem
• An efficient parallel algorithm or visible-surface detection in 3d graphics display
• An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
• A systolic algorithm for hidden surface removal

This page was built for publication:

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