Han Suk KimDidem UnatScott B. BadenJürgen P. Schulze
Automatic viewpoint selection algorithms try to optimize the view of a data set to best show its features. They are often based on information theoretic frameworks. Although many algorithms have shown useful results, they often take several seconds to produce a result because they render the scene from a variety of viewpoints and analyze the result. In this article, we propose a new algorithm for volume data sets that dramatically reduces the running time. Our entire algorithm takes less than a second, which allows it to be integrated into real-time volume-rendering applications. The interactive performance is achieved by solving a maximization problem with a small sample of the data set, instead of rendering it from a variety of directions. We compare performance results of our algorithm to state-of-the-art approaches and show that our algorithm achieves comparable results for the resulting viewpoints. Furthermore, we apply our algorithm to multichannel volume data sets.
Han Suk KimDidem UnatScott B. BadenJürgen P. Schulze
Stefan GutheMichael WandJ. GonserWolfgang Straßer
Joe KnissPatrick McCormickAndy McPhersonJames AhrensJames PainterA. KeaheyCharles Hansen
Ming-Yuen ChanHuamin QuYingcai WuHong Zhou