Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Enhanced Automatic Creation of Multi-Purpose Object Hierarchies

MPG-Autoren
/persons/resource/persons44557

Haber,  Jörg
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45540

Stamminger,  Marc
Computer Graphics, 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

Haber, J., Stamminger, M., & Seidel, H.-P. (2000). Enhanced Automatic Creation of Multi-Purpose Object Hierarchies. In B. A. Barsky, Y. Shinagawa, & W. Wang (Eds.), Proceedings of the 8th Pacific Conference on Computer Graphics and Applications (pp. 52-61;437). Los Alamitos, USA: IEEE.


Zitierlink: https://hdl.handle.net/11858/00-001M-0000-000F-34A0-A
Zusammenfassung
Using well-adapted object hierarchies can support the rendering
of large scenes in different ways. For instance, the quality of the lighting
simulation may be improved, or the computational cost for rendering may be
reduced. However, the meaning of ``well-adapted'' depends heavily on the
criterion due to which the hierarchy has been constructed. Different
applications typically have different demands like low average intersection
cost for a ray tracer or grouping objects with similar material properties
or surface orientation for hierarchical radiosity.

In this paper we propose a new algorithm for the automatic creation of
object hierarchies. The hierarchies are constructed by sequentially
inserting all scene objects into the hierarchy created so far. By
basing the insertion decision on a cost function defined by the user, the
method can be guided to create hierarchies tailored to the desired
application.

The results can be improved significantly by running a global optimization
on the completed hierarchy. During this optimization step we perform a
re-grouping
of the objects in the hierarchy. Any ill-formed groups that were created
during the initial algorithm are subject to being eliminated by our global
optimization.