de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

On Computing Best Fly

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45337

Saleem,  Waqar
Computer Graphics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45522

Song,  Wenhao
Computer Graphics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44112

Belyaev,  Alexander
Computer Graphics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45449

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Saleem, W., Song, W., Belyaev, A., & Seidel, H.-P. (2007). On Computing Best Fly. In M. Sbert (Ed.), Proceedings of the 23rd Spring Conference on Computer Graphics, SCCG 2007 (pp. 143-149). Bratislava, Slovakia: Comenius University.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-200C-7
Zusammenfassung
With growing popularity of online 3D shape databases, the problem of navigation and remote visualisation of large 3D shape models in such repositories is gaining prominence. While some recent work has focused on automatically computing the best view(s) of a given model, little attention has been given to the problem's dynamic counterpart - best fly. In this paper, we propose a solution to this problem that extends on previous best view methods. Given a shape, we use its best views to compute a path on its viewsphere which acts as a trajectory for a virtual camera pointing at the object. We then use the model's geometric properties to determine the speed and zoom of the camera along the path.