A simple output-sensitive algorithm for hidden surface removal

Micha Sharir, Mark H. Overmars

Research output: Contribution to journalArticlepeer-review

Abstract

We derive a simple output-sensitive algorithm for hidden surfaceremoval in a collection of ntriangles in space for which a 1992 depth order is known. Ifk is the combinatorial complexity ofthe output visibility map, the methodruns in time [Formula Omitted]. The method is extended to work for other classes ofobjects as well, sometimes with even improved time bounds. For example,we obtain an algorithm that performs hidden surface removal forn (nonintersecting) balls in time[formula omitted].

Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalACM Transactions on Graphics
Volume11
Issue number1
DOIs
StatePublished - 1 Feb 1992

Keywords

  • hidden line elimination
  • hidden surface removal
  • object-space algorithm

Fingerprint

Dive into the research topics of 'A simple output-sensitive algorithm for hidden surface removal'. Together they form a unique fingerprint.

Cite this