An O(n') hidden-surface removal algorithm is shown. This is an improvement over the previous best worst-case performance of O(n' log n). It has been established that the hidden-line and hiddensurface problems have an Q(n*) worst-case lower bound, so the algorithm is optimal. However, the algorithm is not output-size sensitive. Two corollaries to the result are (1) hidden-lines can be removed in optimal O(n*) time, and (2) the portion of a 3-D polyhedron visible from a given interior point is constructible in optimal O(n*) time.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.