Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Fast Final Gathering via Reverse Photon Mapping

Havran, V., Herzog, R., & Seidel, H.-P. (2005). Fast Final Gathering via Reverse Photon Mapping. In The European Association for Computer Graphics 26th Annual Conference: EUROGRAPHICS 2005 (pp. 323-333). Oxford, UK: Blackwell.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-268A-6 Versions-Permalink: https://hdl.handle.net/21.11116/0000-000E-3028-F
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Havran, Vlastimil1, Autor           
Herzog, Robert1, 2, Autor           
Seidel, Hans-Peter1, Autor                 
Alexa, Marc3, Herausgeber
Marks, Joe3, Herausgeber
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              
3Max Planck Society, ou_persistent13              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We present a new algorithm for computing indirect illumination based on density estimation similarly to photon mapping. We accelerate the search for final gathering by reorganizing the computation in the reverse order. We use two trees that organize spatially not only the position of photons but also the position of final gather rays. The achieved speedup is algorithmic, the performance improvement takes advantage of logarithmic complexity of searching in trees. The algorithm requires almost no user settings unlike many known acceleration techniques for photon mapping. The image quality is the same as for traditional photon mapping with final gathering, since the algorithm does not approximate or interpolate. Optionally, the algorithm can be combined with other techniques such as density control and importance sampling. The algorithm creates a coherent access pattern to the main memory. This further improves on performance and also allows us to use efficient external data structures to alleviate the increased memory requirements.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2006-04-252005
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Oxford, UK : Blackwell
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 279019
Anderer: Local-ID: C125675300671F7B-0EECF60691827774C12570B3004AE164-Havran2005eg05
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Dublin, Ireland
Start-/Enddatum: 2005-08-29

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: The European Association for Computer Graphics 26th Annual Conference : EUROGRAPHICS 2005
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Oxford, UK : Blackwell
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 323 - 333 Identifikator: -

Quelle 2

einblenden:
ausblenden:
Titel: Computer Graphics Forum
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: - Identifikator: ISSN: 0167-7055