An efficient algorithm for hidden surface removal. II

DOI10.1016/S0022-0000(05)80067-4MaRDI QIDQ1342857zbMATH OpenFDO

Authors Ketan D. Mulmuley

Publication date 21 June 2000

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• Computing convolutions by reciprocal search
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes

Cited in

(3)

• An efficient parallel algorithm or visible-surface detection in 3d graphics display
• Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology
• Approximating the k-Level in Three-Dimensional Plane Arrangements

This page was built for publication: An efficient algorithm for hidden surface removal. II

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