scientific article; zbMATH DE number 645774

zbMATH Open0799.68112MaRDI QIDQ4307488FDOQ4307488

Authors:

Publication date: 28 September 1994

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

parallel algorithmsvisibilitycomputer graphicsparallel complexitymodel of parallel computationhidden-line problemcomplexity class \(NC\)

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
• New algorithms for special cases of the hidden line elimination problem
• 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)