---
res:
  bibo_abstract:
  - We present a new output-sensitive rendering algorithm, the randomized z-buffer
    algorithm. It renders an image of a three dimensional scene of triangular primitives
    by reconstruction from a random sample of surface points which are chosen with
    a probability proportional to the projected area of the objects. The approach
    is independent of mesh connectivity and topology. It leads to a rendering time
    that grows only logarithmically with the numbers of triangles in the scene and
    to linear memory consumption, thus allowing walkthroughs of scenes of extreme
    complexity. We consider different methods for image reconstruction which aim at
    correctness, rendering speed and image quality and we develop an efficient data
    structure for sample extraction in output-sensitive time which allows for efficient
    dynamic updates of the scene. Experiments confirm that scenes consisting of some
    hundred billion triangles can be rendered within seconds with an image quality
    comparable to a conventional z-buffer rendering; in special cases, realtime performance
    can be achieved.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Wand, Michael
      foaf_surname: Wand
  - foaf_Person:
      foaf_givenName: Matthias
      foaf_name: Fischer, Matthias
      foaf_surname: Fischer
      foaf_workInfoHomepage: http://www.librecat.org/personId=146
  - foaf_Person:
      foaf_givenName: Friedhelm
      foaf_name: Meyer auf der Heide, Friedhelm
      foaf_surname: Meyer auf der Heide
      foaf_workInfoHomepage: http://www.librecat.org/personId=15523
  dct_date: 2000^xs_gYear
  dct_language: eng
  dct_title: Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic
    Scenes@
...