Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Fast and Accurate Ray-Voxel Intersection Techniques for Iso-Surface Ray Tracing

MPG-Autoren
/persons/resource/persons44991

Marmitt,  Gerd
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44790

Kleer,  Andreas
Discrete Optimization, MPI for Informatics, Max Planck Society;

/persons/resource/persons44445

Friedrich,  Heiko
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45688

Wald,  Ingo
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44965

Magnor,  Marcus
Graphics - Optics - Vision, MPI for Informatics, Max Planck Society;

/persons/resource/persons45449

Seidel,  Hans-Peter
Computer Graphics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PuRe verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Marmitt, G., Kleer, A., Friedrich, H., Wald, I., & Slusallek, P. (2004). Fast and Accurate Ray-Voxel Intersection Techniques for Iso-Surface Ray Tracing. In Vision, Modeling, and Visualization 2004 (VMV-04) (pp. 429-435). Berlin: Akademische Verlagsgesellschaft Aka.


Zitierlink: https://hdl.handle.net/11858/00-001M-0000-000F-29C9-2
Zusammenfassung
Visualizing iso-surfaces of volumetric data sets is becoming increasingly important for many practical applications. One crucial task in iso-surface ray tracing is to find the correct intersection of a ray with the trilinear-interpolated implicit surface defined by the data values at the vertices of a given voxel. Currently available solutions are either accurate but slow or they provide fast but only approximate solutions. In this paper, we analyze the available techniques and present a new intersection algorithm. We compare and evaluate the new algorithm against previous approaches using both synthetic test cases and real world data sets. The new algorithm is roughly three times faster but provides the same image quality and better numerical stability as previous accurate solutions.