Visible surface calculation for complex unstructured polygonal scenes

DOI10.1007/BF02240191zbMath0566.51026MaRDI QIDQ1059281

J. Blot

Publication date: 1985

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

computational complexitycomputer graphicscomputational geometryvisible surface algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Euclidean analytic geometry (51N20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to computer science (68-04)

Cites Work

• Unnamed Item
• Triangulating a simple polygon

This page was built for publication: Visible surface calculation for complex unstructured polygonal scenes