N-Buffers for efficient depth map query - Archive ouverte HAL Access content directly
Journal Articles Computer Graphics Forum Year : 2005

N-Buffers for efficient depth map query

(1)
1

Abstract

We introduce the N-buffer as a tool for multiresolution depth map representation. This neighborhood buffer encodes the value and position of local depth extrema at different scales in an image cube, in contrast to the image pyramid. The resulting increase in storage space is largely compensated by the following benefits: objects of any size can be culled in constant time against an occlusion map using four depth lookups; visibility-like queries can be performed in vertex and fragment programs; N-buffers can be computed very efficiently with graphics hardware. We present three applications of this datastructure, and in particular a novel approach for shadow volume acceleration.
Fichier principal
Vignette du fichier
final-electronic.pdf (2.24 Mo) Télécharger le fichier
Vignette du fichier
nbuffer.png (22.9 Ko) Télécharger le fichier
Vignette du fichier
nbuffer05.ppt (7.71 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Format : Other
Loading...

Dates and versions

inria-00510154 , version 1 (13-10-2010)

Identifiers

  • HAL Id : inria-00510154 , version 1

Cite

Xavier Décoret. N-Buffers for efficient depth map query. Computer Graphics Forum, 2005, 24 (3). ⟨inria-00510154⟩
245 View
439 Download

Share

Gmail Facebook Twitter LinkedIn More