An efficient algorithm for hidden surface removal. II

DOI10.1016/S0022-0000(05)80067-4zbMATH Open0938.68947MaRDI QIDQ1342857FDOQ1342857

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

• Title not available (Why is that?)
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Computing convolutions by reciprocal search

Cited In (3)

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

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)