Learn More
The Closest Point Method (CPM) is a method for numerically solving partial differential equations (PDEs) on arbitrary surfaces, independent of the existence of a surface parametrization. The CPM uses a closest point representation of the surface, to solve the unmodified Cartesian version of a surface PDE in a 3D volume embedding, using simple and(More)
The augmentation of objects by textual annotations provides a powerful means for visual data exploration. Especially in interactive scenarios, where the view on the objects and, thus, the preferred placement of annotations changes continually, efficient labeling procedures are required. As identified by a preliminary study for this paper, these procedures(More)
Despite the ongoing efforts in turbulence research, the universal properties of the turbulence small-scale structure and the relationships between small- and large-scale turbulent motions are not yet fully understood. The visually guided exploration of turbulence features, including the interactive selection and simultaneous visualization of multiple(More)
Previous terrain rendering approaches have addressed the aspect of data compression and fast decoding for rendering, but applications where the terrain is repeatedly modified and needs to be buffered on disk have not been considered so far. Such applications require both decoding and encoding to be faster than disk transfer. We present a novel approach for(More)
Interactive and high-quality visualization of spatially continuous 3D fields represented by scattered distributions of billions of particles is challenging. One common approach is to resample the quantities carried by the particles to a regular grid and to render the grid via volume ray-casting. In large-scale applications such as astrophysics, however, the(More)
The efficient and high quality rendering of complex road networks—given as vector data—and high-resolution digital elevation models (DEMs) poses a significant problem in 3D geographic information systems. As in paper maps, a cartographic representation of roads with rounded caps and accentuated clearly distinguishable colors is desirable. On the other hand,(More)
Kai Bürger, ∗ Marc Treib, † Rüdiger Westermann, ‡ Suzanne Werner, § Cristian C Lalescu, ¶ Alexander Szalay, ∗∗ Charles Meneveau, †† and Gregory L Eyink 3, 4, ‡‡ Informatik 15 (Computer Graphik & Visualisierung), Technische Universität München, 85748 Garching bei München, Germany Department of Physics & Astronomy, The Johns Hopkins University, Baltimore, MD(More)
We shed light on the accuracy of particle trajectories in turbulent vector fields when lossy data compression is used. So far, data compression has been considered rather hesitantly due to supposed accuracy issues. Motivated by the observation that particle traces are always afflicted with inaccuracy, we quantitatively analyze the additional inaccuracies(More)
  • 1