Conference stringclasses 6 values | Year int64 1.99k 2.03k | Title stringlengths 8 187 | DOI stringlengths 16 32 | Abstract stringlengths 128 7.15k ⌀ | Accessible bool 2 classes | Early bool 2 classes | AuthorNames-Deduped listlengths 1 24 | Award listlengths 0 2 | Resources listlengths 0 5 | ResourceLinks listlengths 0 10 |
|---|---|---|---|---|---|---|---|---|---|---|
Vis | 1,999 | Exploring geo-scientific data in virtual environments | 10.1109/VISUAL.1999.809884 | This paper describes tools and techniques for the exploration of gee-scientific data from the oil and gas domain in stereoscopic virtual environments. The two main sources of data in the exploration task are seismic volumes and multivariate well logs of physical properties down a bore hole. We have developed a props-based interaction device called the cubic mouse to allow more direct and intuitive interaction with a cubic seismic volume. This device effectively places the seismic cube in the user's hand. Geologists who have tried this device have been enthusiastic about the ease of use, and were adept only a few moments after picking it up. We have also developed a multi-modal, visualisation and sonification technique for the dense, multivariate well log data. The visualisation can show two well log variables mapped along the well geometry in a bivariate colour scheme, and another variable on a sliding lens. A sonification probe is attached to the lens so that other variables can be heard. The sonification is based on a Geiger-counter metaphor that is widely understood and which makes it easy to explain. The data is sonified at higher or lower resolutions depending on the speed of the lens. Sweeps can be made at slower rates and over smaller intervals to home in on peaks, boundaries or other features in the full resolution data set. | false | false | [
"Bernd Fröhlich 0001",
"Stephen Barrass",
"Björn Zehner",
"John Plate",
"Martin Göbel"
] | [] | [] | [] |
Vis | 1,999 | Feature Comparisons Of 3-D Vector Fields Using Earth Mover's Distance | 10.1109/VISUAL.1999.809874 | A method for comparing three-dimensional vector fields constructed from simple critical points is described. This method is a natural extension of previous work (Y. Lavin et al., 1998), which defined a distance metric for comparing two-dimensional fields. The extension to three-dimensions follows the path of our previous work, rethinking the representation of a critical point signature and the distance measure between the points. Since the method relies on topologically based information, problems such as grid matching and vector alignment which often complicate other comparison techniques are avoided. In addition, since only feature information is used to represent, and is therefore stored for each field, a significant amount of compression occurs. | false | false | [
"Rajesh Batra",
"Lambertus Hesselink"
] | [] | [] | [] |
Vis | 1,999 | Forward image mapping | 10.1109/VISUAL.1999.809872 | We present a novel forward image mapping algorithm, which speeds up perspective warping, as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting to the target image. The algorithm reduces the complexity of perspective-correct image warping by eliminating the division per pixel and replacing it with a division per scanline. The method also corrects the perspective distortion in Gouraud shading with negligible overhead. Furthermore, the special scanline order is suitable for antialiasing using a more accurate antialiasing conic filter, with minimum additional cost. The algorithm is highlighted by incremental calculations and optimized memory bandwidth by reading each source pixel only once, suggesting a potential hardware implementation. | false | false | [
"Baoquan Chen",
"Frank Dachille",
"Arie E. Kaufman"
] | [] | [] | [] |
Vis | 1,999 | Geo-spatial visualization for situational awareness | 10.1109/VISUAL.1999.809925 | Situational awareness applications require a highly detailed geospatial visualization covering a large geographic area. Conventional polygon based terrain modeling would exceed the capacity of current computer rendering. Terrain visualization techniques for a situational awareness application are described in this case study. Visualizing large amounts of terrain data has been achieved using very large texture maps. Sun shading is applied to the terrain texture map to enhance perception of relief features. Perception of submarine positions has been enhanced using a translucent, textured water surface. | false | false | [
"Eliot Feibush",
"Nikhil Gagvani",
"Daniel Williams"
] | [] | [] | [] |
Vis | 1,999 | Hierarchical parallel coordinates for exploration of large datasets | 10.1109/VISUAL.1999.809866 | Our ability to accumulate large, complex (multivariate) data sets has far exceeded our ability to effectively process them in searching for patterns, anomalies and other interesting features. Conventional multivariate visualization techniques generally do not scale well with respect to the size of the data set. The focus of this paper is on the interactive visualization of large multivariate data sets based on a number of novel extensions to the parallel coordinates display technique. We develop a multi-resolution view of the data via hierarchical clustering, and use a variation of parallel coordinates to convey aggregation information for the resulting clusters. Users can then navigate the resulting structure until the desired focus region and level of detail is reached, using our suite of navigational and filtering tools. We describe the design and implementation of our hierarchical parallel coordinates system which is based on extending the XmdvTool system. Lastly, we show examples of the tools and techniques applied to large (hundreds of thousands of records) multivariate data sets. | false | false | [
"Ying-Huey Fua",
"Matthew O. Ward",
"Elke A. Rundensteiner"
] | [
"TT"
] | [] | [] |
Vis | 1,999 | High performance presence-accelerated ray casting | 10.1109/VISUAL.1999.809911 | We present a novel presence acceleration for volumetric ray casting. A highly accurate estimation for object presence is obtained by projecting all grid cells associated with the object boundary on the image plane. Memory space and access time are reduced by run-length encoding of the boundary cells, while boundary cell projection time is reduced by exploiting projection templates and multiresolution volumes. Efforts have also been made towards a fast perspective projection as well as interactive classification. We further present task partitioning schemes for effective parallelization of both boundary cell projection and ray traversal procedures. Good load balancing has been reached by taking full advantage of both the optimizations in the serial rendering algorithm and shared-memory architecture. Our experimental results on a 16-processor SGI Power Challenge have shown interactive rendering rates for 256/sup 3/ volumetric data sets at 10-30 Hz. We describe the theory and implementation of our algorithm, and shows its superiority over the shear-warp factorization approach. | false | false | [
"Ming Wan",
"Arie E. Kaufman",
"Steve Bryson"
] | [] | [] | [] |
Vis | 1,999 | Hue-balls and lit-tensors for direct volume rendering of diffusion tensor fields | 10.1109/VISUAL.1999.809886 | With the development of magnetic resonance imaging techniques for acquiring diffusion tensor data from biological tissue, visualization of tensor data has become a new research focus. The diffusion tensor describes the directional dependence of water molecules' diffusion and can be represented by a three-by-three symmetric matrix. Visualization of second-order tensor fields is difficult because the data values have many degrees of freedom. Existing visualization techniques are best at portraying the tensor's properties over a two-dimensional field, or over a small subset of locations within a three-dimensional field. A means of visualizing the global structure in measured diffusion tensor data is needed. We propose the use of direct volume rendering, with novel approaches for the tensors' coloring, lighting, and opacity assignment. Hue-balls use a two-dimensional colormap on the unit sphere to illustrate the tensor's action as a linear operator. Lit-tensors provide a lighting model for tensors which includes as special cases both lit-lines (from streamline vector visualization) and standard Phong surface lighting. Together with an opacity assignment based on a novel two-dimensional barycentric space of anisotropy, these methods are shown to produce informative renderings of measured diffusion tensor data from the human brain. | false | false | [
"Gordon L. Kindlmann",
"David M. Weinstein"
] | [
"BP"
] | [] | [] |
Vis | 1,999 | Image graphs-a novel approach to visual data exploration | 10.1109/VISUAL.1999.809871 | For types of data visualization where the cost of producing images is high, and the relationship between the rendering parameters and the image produced is less than obvious, a visual representation of the exploration process can make the process more efficient and effective. Image graphs represent not only the results but also the process of data visualization. Each node in an image graph consists of an image and the corresponding visualization parameters used to produce it. Each edge in a graph shows the change in rendering parameters between the two nodes it connects. Image graphs are not just static representations; users can interact with a graph to review a previous visualization session or to perform new rendering. Operations which cause changes in rendering parameters can propagate through the graph. The user can take advantage of the information in image graphs to understand how certain parameter changes affect visualization results. Users can also share image graphs to streamline the process of collaborative visualization. We have implemented a volume visualization system using the image graph interface, and the examples presented come from this application. | false | false | [
"Kwan-Liu Ma"
] | [] | [] | [] |
Vis | 1,999 | Implant sprays: compression of progressive tetrahedral mesh connectivity | 10.1109/VISUAL.1999.809901 | Irregular tetrahedral meshes, which are popular in many engineering and scientific applications, often contain a large number of vertices. A mesh of V vertices and T tetrahedra requires 48 V bits or less to store the vertex coordinates, 4/spl middot/T/spl middot/log/sub 2/(V) bits to store the tetrahedra-vertex incidence relations, also called connectivity information, and kV bits to store the k-bit value samples associated with the vertices. Given that T is 5 to 7 times larger than V and that V often exceeds 32/sup 3/, the storage space required for the connectivity is larger than 300 V bits and thus dominates the overall storage cost. Our "implants spray" compression approach introduced in the paper reduces this cost to about 30 V bits or less-a 10:1 compression ratio. Furthermore, implant spray supports the progressive refinement of a crude model through a series of vertex-splits operations. | false | false | [
"Renato Pajarola",
"Jarek Rossignac",
"Andrzej Szymczak"
] | [] | [] | [] |
Vis | 1,999 | Interactive exploration of extra- and interacranial blood vessels | 10.1109/VISUAL.1999.809912 | We present a system for interactive explorations of extra- and intracranial blood vessels. Starting with a stack of images from 3D angiography, we use virtual clips to limit the segmentation of the vessel tree to the parts the neuroradiologists are interested in. Furthermore, methods of interactive virtual endoscopy are applied in order to provide an interior view of the blood vessels. | false | false | [
"Dirk Bartz",
"Wolfgang Straßer",
"Martin Skalej",
"Dorothea Welte"
] | [] | [] | [] |
Vis | 1,999 | Interactive exploration of volume line integral convolution based on 3D-texture mapping | 10.1109/VISUAL.1999.809892 | Line integral convolution (LIC) is an effective technique for visualizing vector fields. The application of LIC to 3D flow fields has yet been limited by difficulties to efficiently display and animate the resulting 3D-images. Texture-based volume rendering allows interactive visualization and manipulation of 3D-LIC textures. In order to ensure the comprehensive and convenient exploration of flow fields, we suggest interactive functionality including transfer functions and different clipping mechanisms. Thereby, we efficiently substitute the calculation of LIC based on sparse noise textures and show the convenient visual access of interior structures. Further on, we introduce two approaches for animating static 3D-flow fields without the computational expense and the immense memory requirements for pre-computed 3D-textures and without loss of interactivity. This is achieved by using a single 3D-LIC texture and a set of time surfaces as clipping geometries. In our first approach we use the clipping geometry to pre-compute a special 3D-LIC texture that can be animated by time-dependent color tables. Our second approach uses time volumes to actually clip the 3D-LIC volume interactively during rasterization. Additionally, several examples demonstrate the value of our strategy in practice. | false | false | [
"Christof Rezk-Salama",
"Peter Hastreiter",
"Christian Teitzel",
"Thomas Ertl"
] | [] | [] | [] |
Vis | 1,999 | Interactive lens visualization techniques | 10.1109/VISUAL.1999.809882 | The paper describes new techniques for minimally immersive visualization of 3D scalar and vector fields, and visualization of document corpora. In our glyph based visualization system, the user interacts with the 3D volume of glyphs using a pair of button-enhanced 3D position and orientation trackers. The user may also examine the volume using an interactive lens, which is a rectangle that slices through the 3D volume and displays scalar information on its surface. A lens allows the display of scalar data in the 3D volume using a contour diagram, and a texture based volume rendering. | false | false | [
"Chris Shaw 0002",
"James A. Hall",
"David S. Ebert",
"D. Aaron Roberts"
] | [] | [] | [] |
Vis | 1,999 | Interactive visualization of fluid dynamics simulations in locally refined cartesian grids | 10.1109/VISUAL.1999.809918 | The work presents interactive flow visualization techniques specifically adapted for PowerFLOW/sup TM/, a lattice based CFD code from the EXA corporation. Their Digital Physics/sup TM/ fluid simulation technique is performed on a hierarchy of locally refined cartesian grids with a fine voxel resolution in areas of interesting flow features. Among other applications, the PowerFLOW solver is used for aerodynamic simulations in car body development where the advantages of automatic grid generation from CAD models is of great interest. In a joint project with BMW and EXA, we are developing a visualization tool which incorporates virtual reality techniques for the interactive exploration of the large scalar and vector data sets. We describe the specific data structures and interpolation techniques and we report on fast particle tracing, taking into account collisions with the car body geometry. An OpenGL Optimizer based implementation allows for the inspection of the flow with particle probes and slice probes at interactive frame rates. | false | false | [
"Martin Schulz 0005",
"Frank Reck",
"Wolf Bartelheimer",
"Thomas Ertl"
] | [] | [] | [] |
Vis | 1,999 | Isosurface extraction in time-varying fields using a Temporal Branch-on-Need Tree (T-BON) | 10.1109/VISUAL.1999.809879 | The Temporal Branch-on-Need Tree (T-BON) extends the three dimensional branch-on-need octree for time-varying isosurface extraction. At each time step, only those portions of the tree and data necessary to construct the current isosurface are read from disk. This algorithm can thus exploit the temporal locality of the isosurface and, as a geometric technique, spatial locality between cells in order to improve performance. Experimental results demonstrate the performance gained and memory overhead saved using this technique. | false | false | [
"Philip M. Sutton",
"Charles D. Hansen"
] | [] | [] | [] |
Vis | 1,999 | Isosurface extraction techniques for Web-based volume visualization | 10.1109/VISUAL.1999.809878 | The reconstruction of isosurfaces from scalar volume data has positioned itself as a fundamental visualization technique in many different applications. But the dramatically increasing size of volumetric data sets often prohibits the handling of these models on affordable low-end single processor architectures. Distributed client-server systems integrating high-bandwidth transmission channels and Web based visualization tools are one alternative to attack this particular problem, but therefore new approaches to reduce the load of numerical processing and the number of generated primitives are required. We outline different scenarios for distributed isosurface reconstruction from large scale volumetric data sets. We demonstrate how to directly generate stripped surface representations and we introduce adaptive and hierarchical concepts to minimize the number of vertices that have to be reconstructed, transmitted and rendered. Furthermore, we propose a novel computation scheme, which allows the user to flexibly exploit locally available resources. The proposed algorithms have been merged together in order to build a platform-independent Web based application. Extensive use of VRML and Java OpenGL bindings allows for the exploration of large scale volume data quite efficiently. | false | false | [
"Klaus Engel",
"Rüdiger Westermann",
"Thomas Ertl"
] | [] | [] | [] |
Vis | 1,999 | Large field visualization with demand-driven calculation | 10.1109/VISUAL.1999.809864 | Presents a system designed for the interactive definition and visualization of fields derived from large data sets: the Demand-Driven Visualizer (DDV). The system allows the user to write arbitrary expressions to define new fields, and then apply a variety of visualization techniques to the result. Expressions can include differential operators and numerous other built-in functions. Determination of field values, both in space and in time, is directed automatically by the demands of the visualization techniques. The payoff of following a demand-driven design philosophy throughout the visualization system becomes particularly evident when working with large time-series data, where the costs of eager evaluation alternatives can be prohibitive. | false | false | [
"Patrick J. Moran",
"Chris Henze"
] | [] | [] | [] |
Vis | 1,999 | LOD-sprite technique for accelerated terrain rendering | 10.1109/VISUAL.1999.809900 | We present a novel rendering technique, termed LOD-sprite rendering, which uses a combination of a level-of-detail (LOD) representation of the scene together with reusing image sprites (previously rendered images). Our primary application is accelerating terrain rendering. The LOD-sprite technique renders an initial frame using a high-resolution model of the scene geometry. It renders subsequent frames with a much lower-resolution model of the scene geometry and texture-maps each polygon with the image sprite from the initial high-resolution frame. As it renders these subsequent frames, the technique measures the error associated with the divergence of the view position from the position where the initial frame was rendered. Once this error exceeds a user-defined threshold, the technique re-renders the scene from the high-resolution model. We have efficiently implemented the LOD-sprite technique with texture mapping graphics hardware. Although to date we have only applied LOD-sprite to terrain rendering, it could easily be extended to other applications. We feel LOD-sprite holds particular promise for real time rendering systems. | false | false | [
"Baoquan Chen",
"J. Edward Swan II",
"Eddy Kuo",
"Arie E. Kaufman"
] | [] | [] | [] |
Vis | 1,999 | Mixing translucent polygons with volumes | 10.1109/VISUAL.1999.809887 | We present an algorithm which renders opaque and/or translucent polygons embedded within volumetric data. The processing occurs such that all objects are composited in the correct order, by rendering thin slabs of the translucent polygons between volume slices using slice-order volume rendering. We implemented our algorithm with OpenGL on current general-purpose graphics systems. We discuss our system implementation, speed and image quality, as well as the renderings of several mixed scenes. | false | false | [
"Kevin Kreeger",
"Arie E. Kaufman"
] | [] | [] | [] |
Vis | 1,999 | Multi-projector displays using camera-based registration | 10.1109/VISUAL.1999.809883 | Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes. | false | false | [
"Ramesh Raskar",
"Michael S. Brown",
"Ruigang Yang",
"Wei-Chao Chen",
"Greg Welch",
"Herman Towles",
"W. Brent Seales",
"Henry Fuchs"
] | [] | [] | [] |
Vis | 1,999 | Multi-resolution multi-field ray tracing: a mathematical overview | 10.1109/VISUAL.1999.809888 | A rigorous mathematical review of ray tracing is presented. The concept of a generic voxel decoder acting on flexible voxel formats is introduced. The necessity of interpolating opacity weighted colors is proved, using a new definition of the blending process in terms of functional integrals. The continuum limit of the discrete opacity accumulation formula is presented, and its convexity properties are investigated. The issues pertaining to interpolation/classification order are discussed. The lighting equation is expressed in terms of opacity weighted colors. The multi-resolution (along the ray) correction of the opacity-weighted color is derived. The mathematics of filtering on the image plane are studied, and an upper limit of the local pixel size on the image plane is obtained. Interpolation of pixel values on the image plane is shown to be in-equivalent to blending of interpolated samples. | false | false | [
"Charidimos E. Gasparakis"
] | [] | [] | [] |
Vis | 1,999 | Multiresolution Techniques for Interactive Texture-based Volume Visualization | 10.1109/VISUAL.1999.809908 | We present a multiresolution technique for interactive texture-based volume visualization of very large data sets. This method uses an adaptive scheme that renders the volume in a region-of-interest at a high resolution and the volume away from this region at progressively lower resolutions. The algorithm is based on the segmentation of texture space into an octree, where the leaves of the tree define the original data and the internal nodes define lower-resolution versions. Rendering is done adaptively by selecting high-resolution cells close to a center of attention and low-resolution cells away from this area. We limit the artifacts introduced by this method by modifying the transfer functions in the lower-resolution data sets and utilizing spherical shells as a proxy geometry. It is possible to use this technique to produce viewpoint-dependent renderings of very large data sets. | false | false | [
"Eric LaMar",
"Bernd Hamann",
"Kenneth I. Joy"
] | [] | [] | [] |
Vis | 1,999 | New quadric metric for simplifying meshes with appearance attributes | 10.1109/VISUAL.1999.809869 | Complex triangle meshes arise naturally in many areas of computer graphics and visualization. Previous work has shown that a quadric error metric allows fast and accurate geometric simplification of meshes. This quadric approach was recently generalized to handle meshes with appearance attributes. In this paper we present an improved quadric error metric for simplifying meshes with attributes. The new metric, based on geometric correspondence in 3D, requires less storage, evaluates more quickly, and results in more accurate simplified meshes. Meshes often have attribute discontinuities, such as surface creases and material boundaries, which require multiple attribute vectors per vertex. We show that a wedge-based mesh data structure captures such discontinuities efficiently and permits simultaneous optimization of these multiple attribute vectors. In addition to the new quadric metric, we experiment with two techniques proposed in geometric simplification, memoryless simplification and volume preservation, and show that both of these are beneficial within the quadric framework. The new scheme is demonstrated on a variety of meshes with colors and normals. | false | false | [
"Hugues Hoppe"
] | [] | [] | [] |
Vis | 1,999 | Optimal triangular Haar bases for spherical data | 10.1109/VISUAL.1999.809898 | Multiresolution analysis based on FWT (Fast Wavelet Transform) is now widely used in scientific visualization. Spherical biorthogonal wavelets for spherical triangular grids were introduced by P. Schroder and W. Sweldens (1995). In order to improve on the orthogonality of the wavelets, the concept of nearly orthogonality, and two new piecewise-constant (Haar) bases were introduced by G.M. Nielson (1997). We extend the results of Nielson. First we give two one-parameter families of triangular Haar wavelet bases that are nearly orthogonal in the sense of Nielson. Then we introduce a measure of orthogonality. This measure vanishes for orthogonal bases. Eventually, we show that we can find an optimal parameter of our wavelet families, for which the measure of orthogonality is minimized. Several numerical and visual examples for a spherical topographic data set illustrates our results. | false | false | [
"Georges-Pierre Bonneau"
] | [] | [] | [] |
Vis | 1,999 | PLIC: bridging the gap between streamlines and LIC | 10.1109/VISUAL.1999.809906 | This paper explores mapping strategies for generating LIC-like images from streamlines and streamline-like images from LIC. The main contribution of this paper is a technique which we call pseudo-LIC or PLIC. By adjusting a small set of key parameters, PLIC can generate flow visualizations that span the spectrum of streamline-like to LIC-like images. Among the advantages of PLIC are: image quality comparable with LIC, performance speedup over LIC, use of a template texture that is independent of the size of the flow field, handles the problem of multiple streamlines occupying the same pixel in image space, reduced aliasing, applicability to time varying data sets, and variable speed animation. | false | false | [
"Vivek Verma",
"David L. Kao",
"Alex T. Pang"
] | [] | [] | [] |
Vis | 1,999 | Progressive compression and transmission of arbitrary triangular meshes | 10.1109/VISUAL.1999.809902 | The recent growth in the size and availability of large triangular surface models has generated interest in compact multi-resolution progressive representation and data transmission. An ongoing challenge is to design an efficient data structure that encompasses both compactness of geometric representations and visual quality of progressive representations. We introduce a topological layering based data structure and an encoding scheme to build a compact progressive representation of an arbitrary triangular mesh (a 2D simplicial complex in 3D) with attached attribute data. This compact representation is composed of multiple levels of detail that can be progressively transmitted and displayed. The global topology, which is the number of holes and connected components, can be flexibly changed among successive levels while still achieving guaranteed size of the coarsest level mesh for very complex models. The flexibility in our encoding scheme also allows topology preserving progressivity. | false | false | [
"Chandrajit L. Bajaj",
"Valerio Pascucci",
"Guozhong Zhuang"
] | [] | [] | [] |
Vis | 1,999 | Progressive Compression of Arbitrary Triangular Meshes | 10.1109/VIS.1999.10000 | null | false | false | [
"Daniel Cohen-Or",
"David Levin",
"Offir Remez"
] | [] | [] | [] |
Vis | 1,999 | Real-time visualization of scalably large collections of heterogeneous objects | 10.1109/VISUAL.1999.809924 | This paper presents results for real-time visualization of out-of-core collections of 3D objects. This is a significant extension of previous methods and shows the generality of hierarchical paging procedures applied both to global terrain and any objects that reside on it. Applied to buildings, the procedure shows the effectiveness of using a screen-based paging and display criterion within a hierarchical framework. The results demonstrate that the method is scalable since it is able to handle multiple collections of buildings (e.g., cities) placed around the earth with full interactivity and without extensive memory load. Further the method shows efficient handling of culling and is applicable to larger, extended collections of buildings. Finally, the method shows that levels of detail can be incorporated to provide improved detail management. | false | false | [
"Douglass Davis",
"William Ribarsky",
"Tian-Yue Jiang",
"Nickolas Faust",
"Sean Ho"
] | [] | [] | [] |
Vis | 1,999 | Rendering on a budget: a framework for time-critical rendering | 10.1109/VISUAL.1999.809875 | We present a technique for optimizing the rendering of high-depth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set. The novelty in our work lies in the fact that we do not explicitly compute visible sets. Instead, our work is based on computing on demand a priority order for the polygons that maximizes the likelihood of rendering visible polygons before occluded ones for any given scene. Given a fixed budget, e.g. time or number of triangles, our rendering algorithm makes sure to render geometry, respecting the computed priority. There are two main steps to our technique: (1) an occupancy based tessellation of space; and (2) a solidity based traversal algorithm. PLP works by computing an occupancy based tessellation of space, which tends to have smaller cells where there are more geometric primitives, e.g., polygons. In this spatial tessellation, each cell is assigned a solidity value, which is directly proportional to its likelihood of occluding other cells. In its simplest form, a cell's solidity value is directly proportional to the number of polygons contained within it. During our traversal algorithm, cells are marked for projection, and the geometric primitives contained within them actually rendered. The traversal algorithm makes use of the cells' solidity, and other view-dependent information to determine the ordering in which to project cells. By tailoring the traversal algorithm to the occupancy based tessellation, we can achieve very good frame rates with low preprocessing and rendering costs. We describe our technique and its implementation in detail. We also provide experimental evidence of its performance and briefly discuss extensions of our algorithm. | false | false | [
"James T. Klosowski",
"Cláudio T. Silva"
] | [] | [] | [] |
Vis | 1,999 | Simplified representation of vector fields | 10.1109/VISUAL.1999.809865 | Vector field visualization remains a difficult task. Many local and global visualization methods for vector fields such as flow data exist, but they usually require extensive user experience on setting the visualization parameters in order to produce images communicating the desired insight. We present a visualization method that produces simplified but suggestive images of the vector field automatically, based on a hierarchical clustering of the input data. The resulting clusters are then visualized with straight or curved arrow icons. The presented method has a few parameters with which users can produce various simplified vector field visualizations that communicate different insights on the vector data. | false | false | [
"Alexandru C. Telea",
"Jarke J. van Wijk"
] | [] | [] | [] |
Vis | 1,999 | Skip Strips: maintaining triangle strips for view-dependent rendering | 10.1109/VISUAL.1999.809877 | View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, view-dependent simplification techniques have not been able to take full advantage of the underlying graphics hardware. Specifically, triangle strips are a widely used hardware-supported mechanism to compactly represent and efficiently render static triangle meshes. However, in a view-dependent framework, the triangle mesh connectivity changes at every frame, making it difficult to use triangle strips. We present a novel data structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications. | false | false | [
"Jihad El-Sana",
"Elvir Azanli",
"Amitabh Varshney"
] | [] | [] | [] |
Vis | 1,999 | Spiraling Edge: fast surface reconstruction from partially organized sample points | 10.1109/VISUAL.1999.809903 | Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized points are extremely time-consuming. Sometimes however, points are generated such that there is additional information available to the reconstruction algorithm. We present Spiraling Edge, a specialized algorithm for surface reconstruction that is three orders of magnitude faster than algorithms for the general case. In addition to sample point locations, our algorithm starts with normal information and knowledge of each point's neighbors. Our algorithm produces a localized approximation to the surface by creating a star-shaped triangulation between a point and a subset of its nearest neighbors. This surface patch is extended by locally triangulating each of the points along the edge of the patch. As each edge point is triangulated, it is removed from the edge and new edge points along the patch's edge are inserted in its place. The updated edge spirals out over the surface until the edge encounters a surface boundary and stops growing in that direction, or until the edge reduces to a small hole that is filled by the final triangle. | false | false | [
"Patricia Crossno",
"Edward Angel"
] | [] | [] | [] |
Vis | 1,999 | Splatting without the blur | 10.1109/VISUAL.1999.809909 | Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation. Only voxels that have values inside the iso-range need to be considered, and these voxels can be projected via efficient rasterization schemes. In splatting, each projected voxel is represented as a radially symmetric interpolation kernel, equivalent to a fuzzy ball. Projecting such a basis function leaves a fuzzy impression, called a footprint or splat, on the screen. Splatting traditionally classifies and shades the voxels prior to projection, and thus each voxel footprint is weighted by the assigned voxel color and opacity. Projecting these fuzzy color balls provides a uniform screen image for homogeneous object regions, but leads to a blurry appearance of object edges. The latter is clearly undesirable, especially when the view is zoomed on the object. In this work, we manipulate the rendering pipeline of splatting by performing the classification and shading process after the voxels have been projected onto the screen. In this way volume contributions outside the iso-range never affect the image. Since shading requires gradients, we not only splat the density volume, using regular splats, but we also project the gradient volume, using gradient splats. However alternative to gradient splats, we can also compute the gradients on the projection plane using central differencing. This latter scheme cuts the number of footprint rasterization by a factor of four since only the voxel densities have to be projected. | false | false | [
"Klaus Mueller 0001",
"Torsten Möller",
"Roger Crawfis"
] | [] | [] | [] |
Vis | 1,999 | Structured spatial domain image and data comparison metrics | 10.1109/VISUAL.1999.809873 | Often, images or datasets have to be compared to facilitate choices of visualization and simulation parameters respectively. Common comparison techniques include side-by-side viewing and juxtaposition, in order to facilitate visual verification of verisimilitude. We propose quantitative techniques which accentuate differences in images and datasets. The comparison is enabled through a collection of partial metrics which, essentially, measure the lack of correlation between the datasets or images being compared. That is, they attempt to expose and measure the extent of the inherent structures in the difference between images or datasets. Besides yielding numerical attributes, the metrics also produce images which can visually highlight differences. Our metrics are simple to compute and operate in the spatial domain. We demonstrate the effectiveness of our metrics through examples for comparing images and datasets. | false | false | [
"Nivedita Sahasrabudhe",
"John West 0001",
"Raghu Machiraju",
"Mark Janus"
] | [] | [] | [] |
Vis | 1,999 | Tensorlines: Advection-Diffusion based Propagation through Diffusion Tensor Fields | 10.1109/VISUAL.1999.809894 | Tracking linear features through tensor field datasets is an open research problem with widespread utility in medical and engineering disciplines. Existing tracking methods, which consider only the preferred local diffusion direction as they propagate, fail to accurately follow features as they enter regions of local complexity. This shortcoming is a result of partial voluming; that is, voxels in these regions often contain contributions from multiple features. These combined contributions result in ambiguities when deciding local primary feature orientation based solely on the preferred diffusion direction. We introduce a novel feature extraction method which we term tensorline propagation. Our method resolves the above ambiguity by incorporating information about the nearby orientation of the feature, as well as the anisotropic classification of the local tensor. The nearby orientation information is added in the spirit of an advection term in a standard diffusion based propagation technique, and has the effect of stabilizing the tracking. To demonstrate the efficacy of tensorlines, we apply this method to the neuroscience problem of tracking white-matter bundles within the brain. | false | false | [
"David M. Weinstein",
"Gordon L. Kindlmann",
"Eric C. Lundberg"
] | [] | [] | [] |
Vis | 1,999 | Tetrahedral Mesh Compression with the Cut-Border Machine | 10.1109/VISUAL.1999.809868 | In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine tetrahedral meshes consume several mega-bytes of storage. For archivation and transmission compression algorithms are essential. In scientific applications lossless compression schemes are of primary interest. This paper introduces a new lossless compression scheme for the connectivity of tetrahedral meshes. Our technique can handle all tetrahedral meshes in three dimensional euclidean space even with non manifold border. We present compression and decompression algorithms which consume for reasonable meshes linear time in the number of tetrahedra. The connectivity is compressed to less than 2.4 bits per tetrahedron for all measured meshes. Thus a tetrahedral mesh can almost be reduced to the vertex coordinates, which consume in a common representation about one quarter of the total storage space. We complete our work with solutions for the compression of vertex coordinates and additional attributes, which might be attached to the mesh. | false | false | [
"Stefan Gumhold",
"Stefan Guthe",
"Wolfgang Straßer"
] | [] | [] | [] |
Vis | 1,999 | The "Parallel Vectors" operator-a vector field visualization primitive | 10.1109/VISUAL.1999.809896 | We propose an elementary operation on a pair of vector fields as a building block for defining and computing global line-type features of vector or scalar fields. While usual feature definitions often are procedural and therefore implicit, our operator allows precise mathematical definitions. It can serve as a basis for comparing feature definitions and for reuse of algorithms and implementations. Applications focus on vortex core methods. | false | false | [
"Ronald Peikert",
"Martin Roth"
] | [] | [] | [] |
Vis | 1,999 | Time-critical Multiresolution Scene Rendering | 10.1109/VISUAL.1999.809876 | We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a scene description in which objects are represented as multiresolution meshes. We perform a constrained optimization at each frame to choose the resolution of each potentially visible object that generates the best quality image while meeting timing constraints. The technique provides smooth level-of-detail control and aims at guaranteeing a uniform, bounded frame rate even for widely changing viewing conditions. The optimization algorithm is independent from the particular data structure used to represent multiresolution meshes. The only requirements are the ability to represent a mesh with an arbitrary number of triangles and to traverse a mesh structure at an arbitrary resolution in a short predictable time. A data structure satisfying these criteria is described and experimental results are discussed. | false | false | [
"Enrico Gobbetti",
"Eric Bouvier"
] | [] | [] | [] |
Vis | 1,999 | Visual debugging of visualization software: a case study for particle systems | 10.1109/VISUAL.1999.809919 | Visualization systems are complex dynamic software systems. Debugging such systems is difficult using conventional debuggers because the programmer must try to imagine the three-dimensional geometry based on a list of positions and attributes. In addition, the programmer must be able to mentally animate changes in those positions and attributes to grasp dynamic behaviors within the algorithm. We show that representing geometry, attributes, and relationships graphically permits visual pattern recognition skills to be applied to the debugging problem. The particular application is a particle system used for isosurface extraction from volumetric data. Coloring particles based on individual attributes is especially helpful when these colorings are viewed as animations over successive iterations in the program. Although we describe a particular application, the types of tools that we discuss can be applied to a variety of problems. | false | false | [
"Patricia Crossno",
"Edward Angel"
] | [] | [] | [] |
Vis | 1,999 | Visualization needs more visual design! | 10.1109/VISUAL.1999.809939 | During the past decade, much work in the field of Visualization has resulted from the efforts of at least two groups of researchers. One group has focused on rendering techniques for visualization technologies (e.g. volume rendering), while another group has focused on designing visual elements for the purpose of visualizing a certain application domain (e.g. streamlines to visualize flow fields, as well as most applications in Information Visualization). This panel session brings together researchers from both groups. Together we will argue that utilizing visual design is difficult ,but important for visualization, and we need to work harder to tap into the many centuries of design knowledge that exists in fields such as art, music, theater, cartography, architecture, and so forth. Some of the issues we will explore include: | false | false | [
"J. Edward Swan II",
"Theresa-Marie Rhyne",
"David H. Laidlaw",
"Tamara Munzner",
"Victoria Interrante"
] | [] | [] | [] |
Vis | 1,999 | Visualization of conflicts and resolutions in a "Free Flight" scenario | 10.1109/VISUAL.1999.809923 | "Free Flight" will change today's air traffic control system by giving pilots increased flexibility to choose and modify their routes in real time, reducing costs and increasing system capacity. This increased flexibility comes at the price of increased complexity. If Free Flight is to become a reality, future air traffic controllers, pilots, and airline managers will require new conflict detection, resolution and visualization decision support tools. The paper describes a testbed system for building and evaluating such tools, including its current capabilities, lessons we learned and feedback received from expert users. The visualization system provides an overall plan view supplemented with a detailed perspective view, allowing a user to examine highlighted conflicts and select from a list of proposed solutions, as the scenario runs in real time. Future steps needed to improve this system are described. | false | false | [
"Ronald T. Azuma",
"Howard Neely",
"Michael J. Daily",
"Mario Correa"
] | [] | [] | [] |
Vis | 1,999 | Visualizing gridded datasets with large number of missing values | 10.1109/VISUAL.1999.809916 | Much of the research in scientific visualization has focused on complete sets of gridded data. The paper presents our experience dealing with gridded data sets with a large number of missing or invalid data, and some of our experiments in addressing the shortcomings of standard off-the-shelf visualization algorithms. In particular, we discuss the options in modifying known algorithms to adjust to the specifics of sparse datasets, and provide a new technique to smooth out the side-effects of the operations. We apply our findings to data acquired from NEXRAD (NEXt generation RADars) weather radars, which usually have no more than 3 to 4 percent of all possible cell points filled. | false | false | [
"Suzana Djurcilov",
"Alex T. Pang"
] | [] | [] | [] |
Vis | 1,999 | Visualizing large-scale telecommunication networks and services | 10.1109/VISUAL.1999.809930 | Visual exploration of massive datasets arising from telecommunication networks and services is a challenge. This paper describes SWIFT-3D, an integrated data visualization and exploration system created at AT&T Labs for large scale network analysis. SWIFT-3D integrates a collection of interactive tools that includes pixel-oriented 2D maps, interactive 3D maps, statistical displays, network topology diagrams and an interactive drill-down query interface. Example applications are described, demonstrating a successful application to analyze unexpected network events (high volumes of unanswered calls), and comparison of usage of an Internet service with voice network traffic and local access coverage. | false | false | [
"Eleftherios Koutsofios",
"Stephen C. North",
"Russell Truscott",
"Daniel A. Keim"
] | [] | [] | [] |
Vis | 1,999 | Visualizing Multivalued Data from 2D Incompressible Flows Using Concepts from Painting | 10.1109/VISUAL.1999.809905 | We present a new visualization method for 2D flows which allows us to combine multiple data values in an image for simultaneous viewing. We utilize concepts from oil painting, art and design as introduced in (Laidlaw et al., 1998) to examine problems within fluid mechanics. We use a combination of discrete and continuous visual elements arranged in multiple layers to visually represent the data. The representations are inspired by the brush strokes artists apply in layers to create an oil painting. We display commonly visualized quantities such as velocity and vorticity together with three additional mathematically derived quantities: the rate of strain tensor, and the turbulent charge and turbulent current. We describe the motivation for simultaneously examining these quantities and use the motivation to guide our choice of visual representation for each particular quantity. We present visualizations of three flow examples and observations concerning some of the physical relationships made apparent by the simultaneous display technique that we employed. | false | false | [
"Robert M. Kirby",
"H. Marmanis",
"David H. Laidlaw"
] | [] | [] | [] |
Vis | 1,999 | Visualizing Planar Vector Fields with Normal Component Using Line Integral Convolution | 10.1109/VISUAL.1999.809895 | We present a method for visualizing three dimensional vector fields which are defined on a two dimensional manifold only. These vector fields do exist in real application, as we show by an example of an optical measuring instrument which can gauge the displacement at the surface of a mechanical part. The general idea is to compute LIC textures in the manifold's tangent space and to deform the manifold according to the normal information. The resulting LIC texture is mapped onto the deformed manifold and is rendered as a three dimensional scene. Due to the light's reflection on the deformed manifold, one can interactively explore the result of the deformation. | false | false | [
"Gerik Scheuermann",
"Holger Burbach",
"Hans Hagen"
] | [] | [] | [] |
Vis | 1,999 | Visualizing Simulated Room Fires | 10.1109/VISUAL.1999.809936 | Recent advances in fire science and computer modeling of fires allow scientists to predict fire growth and spread through structures. In this paper we describe a variety of visualizations of simulated room fires for use by both fire protection engineers and fire suppression personnel. We also introduce the concept of fuzzy visualization, which results from the superposition of data from several separate simulations into a single visualization. | false | false | [
"Jayesh Govindarajan",
"Matthew O. Ward",
"Jonathan Barnett"
] | [] | [] | [] |
Vis | 1,999 | Visualizing the evolution of a subject domain: a case study | 10.1109/VISUAL.1999.809927 | We explore the potential of information visualization techniques in enhancing existing methodologies for domain analysis and modeling. In this case study, we particularly focus on visualizing the evolution of the hypertext field based on author co-citation patterns, including the use of a sliding-window scheme to generate a series of annual snapshots of the domain structure, and a factor-referenced color-coding scheme to highlight predominant specialties in the field. | false | false | [
"Chaomei Chen",
"Les Carr"
] | [] | [] | [] |
Vis | 1,999 | VizCraft: a multidimensional visualization tool for aircraft configuration design | 10.1109/VISUAL.1999.809921 | We describe a visualization tool to aid aircraft designers during the conceptual design stage. The conceptual design for an aircraft is defined by a vector of 10-30 parameters. The goal is to find a vector that minimizes an objective function while meeting a series of constraints. VizCraft integrates the simulation code that evaluates the design with visualizations for analyzing the design individually or in contrast to other designs. VizCraft allows the designer to easily switch between the view of a design in the form of a parameter set, and a visualization of the corresponding aircraft. The user can easily see which, if any, constraints are violated. VizCraft also allows the user to view a database of designs using parallel coordinates. | false | false | [
"Amit Goel",
"Chuck Baker",
"Clifford A. Shaffer",
"Bernard Grossman",
"Raphael T. Haftka",
"William H. Mason",
"Layne T. Watson"
] | [] | [] | [] |
Vis | 1,999 | Volume rendering based interactive navigation within the human colon | 10.1109/VISUAL.1999.809914 | We present an interactive navigation system for virtual colonoscopy, which is based solely on high performance volume rendering. Previous colonic navigation systems have employed either a surface rendering or a Z-buffer-assisted volume rendering method that depends on the surface rendering results. Our method is a fast direct volume rendering technique that exploits distance information stored in the potential field of the camera control model, and is parallelized on a multiprocessor. Experiments have been conducted on both a simulated pipe and patients' data sets acquired with a CT scanner. | false | false | [
"Ming Wan",
"Qingyu Tang",
"Arie E. Kaufman",
"Zhengrong Liang",
"Mark Wax"
] | [] | [] | [] |
Vis | 1,999 | Why the PC will be the most pervasive visualization platform in 2001 | 10.1109/VISUAL.1999.809938 | Compact, low cost connector system for flexible tubing is adapted to removably connect a length of flexible plastic tubing for rotational but not axial movement to a recessed opening in a body member such as a pneumatic valve, a fitting, or an air cylinder. Preferably, a cylindrical sleeve member having transverse slots extending completely through opposed walls of the member is pre-positioned in a stepped recessed opening in axially spaced relationship with an elastomeric O-ring sealing member. The sleeve member is preferably retained in a fixed relation relative to the body member by a U-shaped clip. When one desires to attach a length of tubing, the U-shaped clip is removed and the tubing is inserted into the sleeve and O-ring such that its tip portion goes beyond the O-ring into a small central recessed aperture formed in the body member. The legs of the U-shaped retaining clip are then pressed through a pair of spaced, axially transverse opening portions in the body member so as to pass through the transverse slots in the sleeve member and into contact with opposed outer wall surfaces of the tubing. The clip legs slightly compress and deform the tubing and have sharp edge portions which slightly cut into it to prevent it from being removed by pulling or by fluid pressure, yet permitting rotation of the tubing relative to the body member. | false | false | [
"Hanspeter Pfister",
"Michel Cox",
"Peter N. Glaskowsky",
"William E. Lorensen",
"Richard Greco"
] | [] | [] | [] |
InfoVis | 1,999 | 3D interactive visualization for inter-cell dependencies of spreadsheets | 10.1109/INFVIS.1999.801861 | This paper proposes a new technique to visualize dependencies among cells in a spreadsheet. In this way, the system firstly visualizes a spreadsheet on a plane in three-dimensional space, and draws arcs between interrelated cells. By allowing a user to select an arbitrary cell and lift it up with direct manipulation, the system utilizes the third dimension to ameliorate visual occlusion of crossing arcs. As the user lifts a focused cell up, the interrelated cells are lifted up together; thus hidden dataflow networks can be visually intelligible interactively. Because spreadsheets are aimed at calculation itself rather than appearances of outputs, their mechanism is relatively invisible and not obvious for ordinary users. Our visualization helps such users to understand structures and mechanism of spreadsheets. | false | false | [
"Hidekazu Shiozawa",
"Ken-ichi Okada",
"Yutaka Matsushita"
] | [] | [] | [] |
InfoVis | 1,999 | A framework for focus+context visualization | 10.1109/INFVIS.1999.801857 | This paper aims to give a systematic account of focus+context visualization techniques, i.e. visualizations which aim to give users integrated visual access to details and context in a data set. We introduce the notion that there are different orders of information visualization with focus+context being a second-order visualization and provide a formal framework for describing and constructing focus+context visualizations. | false | false | [
"Staffan Björk",
"Lars Erik Holmquist",
"Johan Redström"
] | [] | [] | [] |
InfoVis | 1,999 | A Java-based visual mining infrastructure and applications | 10.1109/INFVIS.1999.801867 | Many real-world KDD (Knowledge Discovery & Data Mining) applications involve the navigation of large volumes of information on the web, such as, Internet resources, hot topics, and telecom phone switches. Quite often users feel lost, confused and overwhelmed with displays that contain too much information. This paper discusses a new content-driven visual mining infrastructure called VisMine, that uses several innovative techniques: (1) hidden visual structure and relationships for uncluttering displays; (2) simultaneous visual presentations for high-dimensional knowledge discovery; and (3) a new visual interface to plug in existing graphic toolkits for expanding its use in a wide variety of visual applications. We have applied this infrastructure to three data mining visualization applications-topic hierarchy for document navigation, web-based trouble shooting, and telecom switch mining. | false | false | [
"Ming C. Hao",
"Umeshwar Dayal",
"Meichun Hsu",
"Jim Baker",
"Bob Deletto"
] | [] | [] | [] |
InfoVis | 1,999 | Aggregate Towers: scale sensitive visualization and decluttering of geospatial data | 10.1109/INFVIS.1999.801863 | We have developed a technique, Aggregate Towers, that allows geospatial data to be visualized across a range of map scales. We use a combination of data aggregation algorithms and dynamically aggregating data markers (e.g., icons or symbols) to accommodate interactive zooming by a user while maintaining a representation that remains intuitive, consistent across multiple scales and uncluttered. This approach implicitly generates multiple levels of overview displays from a single set of underlying data. | false | false | [
"James K. Rayson"
] | [] | [] | [] |
InfoVis | 1,999 | Cluster and calendar based visualization of time series data | 10.1109/INFVIS.1999.801851 | A new method is presented to get an insight into univariate time series data. The problem addressed is how to identify patterns and trends on multiple time scales (days, weeks, seasons) simultaneously. The solution presented is to cluster similar daily data patterns, and to visualize the average patterns as graphs and the corresponding days on a calendar. This presentation provides a quick insight into both standard and exceptional patterns. Furthermore, it is well suited to interactive exploration. Two applications, numbers of employees present and energy consumption, are presented. | false | false | [
"Jarke J. van Wijk",
"Edward R. van Selow"
] | [
"TT"
] | [] | [] |
InfoVis | 1,999 | Constellation: a visualization tool for linguistic queries from MindNet | 10.1109/INFVIS.1999.801869 | Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creators and users refine their algorithms, as opposed to understanding the structure of language. We designed a special-purpose graph layout algorithm which exploits higher-level structure in addition to the basic node and edge connectivity. Our layout prioritizes the creation of a semantic space to encode plausibility instead of traditional graph drawing metrics like minimizing edge crossings. We make careful use of several perceptual channels both to minimize the visual impact of edge crossings and to emphasize highlighted constellations of nodes and edges. | false | false | [
"Tamara Munzner",
"François Guimbretière",
"George G. Robertson"
] | [] | [] | [] |
InfoVis | 1,999 | Cushion treemaps: visualization of hierarchical information | 10.1109/INFVIS.1999.801860 | A new method is presented for the visualization of hierarchical information, such as directory structures and organization structures. Cushion treemaps inherit the elegance of standard treemaps: compact, space-filling displays of hierarchical information, based on recursive subdivision of a rectangular image space. Intuitive shading is used to provide insight in the hierarchical structure. During the subdivision, ridges are added per rectangle, which are rendered with a simple shading model. The result is a surface that consists of recursive cushions. The method is efficient, effective, easy to use and implement, and has a wide applicability. | false | false | [
"Jarke J. van Wijk",
"Huub van de Wetering"
] | [] | [] | [] |
InfoVis | 1,999 | Does animation help users build mental maps of spatial information? | 10.1109/INFVIS.1999.801854 | We examine how animating a viewpoint change in a spatial information system affects a user's ability to build a mental map of the information in the space. We found that animation improves users' ability to reconstruct the information space, with no penalty on task performance time. We believe that this study provides strong evidence for adding animated transitions in many applications with fixed spatial data where the user navigates around the data space. | false | false | [
"Benjamin B. Bederson",
"Angela Boltman"
] | [] | [] | [] |
InfoVis | 1,999 | Domain analysis: a technique to design a user-centered visualization framework | 10.1109/INFVIS.1999.801856 | Domain Analysis for Data Visualization (DADV) is a technique to use when investigating a domain where data visualizations are going to be designed and added to existing software systems. DADV was used to design the data visualization in VisEIO-LCA, which is a framework to visualize environmental data about products. Most of the visualizations are designed using the following stages: formatting data in tables, selecting visual structures, and rendering the data on the screen. Although many visualization authors perform implicit domain analysis, in this paper domain analysis is added explicitly to the process of designing visualizations with the goal of producing move usable software tools. Environmental Life-Cycle Assessment (LCA) is used as a test bed for this technique. | false | false | [
"Octavio Juarez Espinosa",
"Chris Hendrickson",
"James H. Garrett Jr."
] | [] | [] | [] |
InfoVis | 1,999 | Dynamic hierarchy specification and visualization | 10.1109/INFVIS.1999.801859 | This paper describes concepts that underlie the design and implementation of an information exploration system that allows users to impose arbitrary hierarchical organizations on their data. Such hierarchies allow a user to embed important semantic information into the hierarchy definition. Our goal is to recognize the significance of this implicit information and to utilize it in the hierarchy visualization. The innovative features of our system include the dynamic modification of the hierarchy definitions and the definition and implementation of a set of layout algorithms that utilize semantic information implicit in the tree construction. | false | false | [
"Richard M. Wilson 0002",
"R. Daniel Bergeron"
] | [] | [] | [] |
InfoVis | 1,999 | Efficient multi-object dynamic query histograms | 10.1109/INFVIS.1999.801862 | Dynamic queries offer continuous feedback during range queries, and have been shown to be effective and satisfying. Recent work has extended them to datasets of 100,000 objects and, separately, to queries involving relations among multiple objects. The latter work enables filtering houses by properties of their owners, for instance. Our primary concern is providing feedback from histograms during dynamic query. The height of each histogram bar shows the count of selected objects whose attribute value falls into a given range. Unfortunately, previous efficient algorithms for single object queries overcount in the case of multiple objects if for instance, a house has multiple owners. This paper presents an efficient algorithm that with high probability closely approximates the true counts. | false | false | [
"Mark Derthick",
"James Harrison",
"Andrew Moore",
"Steven F. Roth"
] | [] | [] | [] |
InfoVis | 1,999 | Evaluating a visualisation of image similarity as a tool for image browsing | 10.1109/INFVIS.1999.801855 | A similarity metric based on the low-level content of images can be used to create a visualisation in which visually similar images are displayed close to each other. We are carrying out a series of experiments to evaluate the usefulness of this type of visualisation as an image browsing aid. The initial experiment, described, considered whether people would find a given photograph more quickly in a visualisation than in a randomly arranged grid of images. The results show that the subjects were faster with the visualisation, although in post-experiment interviews many of them said that they preferred the clarity and regularity of the grid. We describe an algorithm with which the best aspects of the two layout types can be combined. | false | false | [
"Kerry Rodden",
"Wojciech Basalaj",
"David Sinclair",
"Kenneth R. Wood"
] | [] | [] | [] |
InfoVis | 1,999 | Navigating hierarchies with structure-based brushes | 10.1109/INFVIS.1999.801858 | Interactive selection is a critical component in exploratory visualization, allowing users to isolate subsets of the displayed information for highlighting, deleting, analysis, or focussed investigation. Brushing, a popular method for implementing the selection process, has traditionally been performed in either screen space or data space. We introduce the concept of a structure-based brush, which can be used to perform selection in hierarchically structured data sets. Our structure-based brush allows users to navigate hierarchies by specifying focal extents and level-of-detail on a visual representation of the structure. Proximity-based coloring, which maps similar colors to data that are closely related within the structure, helps convey both structural relationships and anomalies. We describe the design and implementation of our structure-based brushing tool. We also validate its usefulness using two distinct hierarchical visualization techniques, namely hierarchical parallel coordinates and tree-maps. | false | false | [
"Ying-Huey Fua",
"Matthew O. Ward",
"Elke A. Rundensteiner"
] | [] | [] | [] |
InfoVis | 1,999 | Sensemaking of evolving Web sites using visualization spreadsheets | 10.1109/INFVIS.1999.801853 | In the process of knowledge discovery, workers examine available information in order to make sense of it. By sensemaking, we mean interacting with and operating on the information with a variety of information processing mechanisms. Previously, we introduced a concept that uses the spreadsheet metaphor with cells containing visualizations of complex data. We extend and apply a cognitive model called "visual sensemaking" to the visualization spreadsheet. We use the task of making sense of a large Web site as a concrete example throughout the paper for demonstration. Using a variety of visualization techniques, such as the Disk Tree and Cone Tree, we show that the interactions of the visualization spreadsheet help users draw conclusions from the overall relationships of the entire information set. | false | false | [
"Ed H. Chi",
"Stuart K. Card"
] | [] | [] | [] |
InfoVis | 1,999 | The automated multidimensional detective | 10.1109/INFVIS.1999.801865 | Automation has arrived to parallel coordinates. A geometrically motivated classifier is presented and applied, with both training and testing stages, to 3 real datasets. Our results compared to those from 33 other classifiers have the least error. The algorithm is based on parallel coordinates and has very low computational complexity in the number of variables and the size of the dataset-contrasted with the very high or unknown (often unstated) complexity of other classifiers, the low complexity enables the rule derivation to be done in near real-time hence making the classification adaptive to changing conditions, provides comprehensible and explicit rules-contrasted to neural networks which are "black boxes", does dimensionality selection-where the minimal set of original variables (not transformed new variables as in Principal Component Analysis) required to state the rule is found, orders these variables so as to optimize the clarity of separation between the designated set and its complement-this solves the pesky "ordering problem" in parallel coordinates. The algorithm is display independent, hence it can be applied to very large in size and number of variables datasets. Though it is instructive to present the results visually, the input size is no longer display-limited as for visual data mining. | false | false | [
"Alfred Inselberg",
"Tova Avidan"
] | [] | [] | [] |
InfoVis | 1,999 | The sunflower visual metaphor, a new paradigm for dimensional compression | 10.1109/INFVIS.1999.801868 | This paper introduces the Sunflower visual metaphor for information visualization. The visual metaphor is presented as an alternative to current techniques of dimensional compression and the visualization tools that employ them. The paper discusses the motivation for the Sunflower paradigm, its implementation and critical factors for producing an effective visualization. A primary driver in this research effort has been to develop a visualization tool that facilitates browsing, knowledge discovery, and that supports learning through sense making and integration of new information. | false | false | [
"Stuart J. Rose"
] | [] | [] | [] |
InfoVis | 1,999 | VisageWeb: visualizing WWW data in Visage | 10.1109/INFVIS.1999.801864 | VisageWeb is an information-centric user interface to the World Wide Web built within the Visage data visualization environment. This paper traces the development of the VisageWeb project, using it to motivate an exploration of how an information-centric architecture copes with new visualization challenges. We conclude with a presentation of the VisageWeb prototype itself. | false | false | [
"Michael Higgins",
"Peter Lucas 0002",
"Jeffrey Senn"
] | [] | [] | [] |
InfoVis | 1,999 | Visualizing application behavior on superscalar processors | 10.1109/INFVIS.1999.801852 | The advent of superscalar processors with out-of-order execution makes it increasingly difficult to determine how well an application is utilizing the processor and how to adapt the application to improve its performance. We describe a visualization system for the analysis of application behavior on superscalar processors. Our system provides an overview-plus-detail display of the application's execution. A timeline view of pipeline performance data shows the overall utilization of the pipeline. This information is displayed using multiple time scales, enabling the user to drill down from a high-level application overview to a focus region of hundreds of cycles. This region of interest is displayed in detail using an animated cycle-by-cycle view of the execution. This view shows how instructions are reordered and executed and how functional units are being utilized. Additional context views correlate instuctions in this detailed view with the relevant source code for the application. This allows the user to discover the root cause of the poor pipeline utilization and make changes to the application to improve its performance. This visualization system can be easily configured to display a variety of processor models and configurations. We demonstrate it for both the MXS and MMIX processor models. | false | false | [
"Chris Stolte",
"Robert P. Bosch Jr.",
"Pat Hanrahan",
"Mendel Rosenblum"
] | [] | [] | [] |
InfoVis | 1,999 | Visualizing association rules for text mining | 10.1109/INFVIS.1999.801866 | An association rule in data mining is an implication of the form X/spl rarr/Y where X is a set of antecedent items and Y is the consequent item. For years researchers have developed many tools to visualize association rules. However, few of these tools can handle more than dozens of rules, and none of them can effectively manage rules with multiple antecedents. Thus, it is extremely difficult to visualize and understand the association information of a large data set even when all the rules are available. This paper presents a novel visualization technique to tackle many of these problems. We apply the technology to a text mining study on large corpora. The results indicate that our design can easily handle hundreds of multiple antecedent association rules in a three-dimensional display with minimum human interaction, low occlusion percentage, and no screen swapping. | false | false | [
"Pak Chung Wong",
"Paul Whitney",
"James J. Thomas"
] | [] | [] | [] |
EuroVis | 1,999 | 2D Vector Field Visualization Using Furlike Texture | 10.1007/978-3-7091-6803-5_4 | null | false | false | [
"Leila Khouas",
"Christophe Odet",
"Denis Friboulet"
] | [] | [] | [] |
EuroVis | 1,999 | A Client-side Approach towards Platform Independent Molecular Visualization over the World Wide Web | 10.1007/978-3-7091-6803-5_16 | null | false | false | [
"Michael Bender",
"Hans Hagen",
"Axel Seck"
] | [] | [] | [] |
EuroVis | 1,999 | A Comparison of Error Indicators for Multilevel Visualization on Nested Grids | 10.1007/978-3-7091-6803-5_19 | null | false | false | [
"Thomas Gerstner",
"Martin Rumpf",
"Ulrich Weikard"
] | [] | [] | [] |
EuroVis | 1,999 | A Methodology for Comparing Direct Volume Rendering Algorithms Using a Projection-Based Data Level Approach | 10.1007/978-3-7091-6803-5_9 | null | false | false | [
"Kwansik Kim",
"Alex Pang"
] | [] | [] | [] |
EuroVis | 1,999 | Advances in Quality Control of Intraoperative Radiotherapy | 10.1007/978-3-7091-6803-5_29 | null | false | false | [
"Stefan Walter",
"Gerd Straßmann",
"Marco Schmitt 0001"
] | [] | [] | [] |
EuroVis | 1,999 | Analysis and Visualization of the Brain Shift Phenomenon in Neurosurgery | 10.1007/978-3-7091-6803-5_28 | null | false | false | [
"Christoph Lürig",
"Peter Hastreiter",
"Christopher Nimsky",
"Thomas Ertl"
] | [] | [] | [] |
EuroVis | 1,999 | Application of Information Visualization to the Analysis of Software Release History | 10.1007/978-3-7091-6803-5_22 | null | false | false | [
"Harald C. Gall",
"Mehdi Jazayeri",
"Claudio Riva"
] | [] | [] | [] |
EuroVis | 1,999 | Attribute-Based Feature Tracking | 10.1007/978-3-7091-6803-5_7 | null | false | false | [
"Freek Reinders",
"Frits H. Post",
"Hans J. W. Spoelder"
] | [] | [] | [] |
EuroVis | 1,999 | Efficient Ray Intersection for Visualization and Navigation of Global Terrain using Spheroidal Height-Augmented Quadtrees | 10.1007/978-3-7091-6803-5_20 | null | false | false | [
"Zachary Wartell",
"William Ribarsky",
"Larry F. Hodges"
] | [] | [] | [] |
EuroVis | 1,999 | Efficiently Rendering Large Volume Data Using Texture Mapping Hardware | 10.1007/978-3-7091-6803-5_12 | null | false | false | [
"Xin Tong",
"Wenping Wang",
"Wai Wan Tsang",
"Zesheng Tang"
] | [] | [] | [] |
EuroVis | 1,999 | Exploring Instationary Fluid Flows by Interactive Volume Movies | 10.1007/978-3-7091-6803-5_27 | null | false | false | [
"Thomas Glau"
] | [] | [] | [] |
EuroVis | 1,999 | Fast Volume Rotation using Binary Shear-Warp Factorization | 10.1007/978-3-7091-6803-5_14 | null | false | false | [
"Balázs Csébfalvi"
] | [] | [] | [] |
EuroVis | 1,999 | Geodesic Flow on Polyhedral Surfaces | 10.1007/978-3-7091-6803-5_17 | null | false | false | [
"Konrad Polthier",
"Markus Schmies"
] | [] | [] | [] |
EuroVis | 1,999 | Geometric Methods for Vortex Extraction | 10.1007/978-3-7091-6803-5_6 | null | false | false | [
"I. Ari Sadarjoen",
"Frits H. Post"
] | [] | [] | [] |
EuroVis | 1,999 | Interactive Direct Volume Rendering of Time-Varying Data | 10.1007/978-3-7091-6803-5_11 | null | false | false | [
"John P. Clyne",
"John M. Dennis"
] | [] | [] | [] |
EuroVis | 1,999 | Internet-Based Front-End to Network Simulator | 10.1007/978-3-7091-6803-5_23 | null | false | false | [
"Taosong He"
] | [] | [] | [] |
EuroVis | 1,999 | New Approaches for Particle Tracing on Sparse Grids | 10.1007/978-3-7091-6803-5_8 | null | false | false | [
"Christian Teitzel",
"Thomas Ertl"
] | [] | [] | [] |
EuroVis | 1,999 | On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data | 10.1007/978-3-7091-6803-5_18 | null | false | false | [
"Oliver Kreylos",
"Bernd Hamann"
] | [] | [] | [] |
EuroVis | 1,999 | Parallel Multipipe Rendering for Very Large Isosurface Visualization | 10.1007/978-3-7091-6803-5_10 | null | false | false | [
"Tushar Udeshi",
"Charles D. Hansen"
] | [] | [] | [] |
EuroVis | 1,999 | Parallel Ray Casting of Visible Human on Distributed Memory Architectures | 10.1007/978-3-7091-6803-5_26 | null | false | false | [
"Chandrajit Bajaj",
"Insung Ihm",
"Gee Bum Koo",
"Sanghun Park"
] | [] | [] | [] |
EuroVis | 1,999 | Procedural Shape Generation for Multi-dimensional Data Visualization | 10.1007/978-3-7091-6803-5_1 | null | false | false | [
"David S. Ebert",
"Randall M. Rohrer",
"Christopher D. Shaw",
"Pradyut Panda",
"James M. Kukla",
"D. Aaron Roberts"
] | [] | [] | [] |
EuroVis | 1,999 | Real-Time Maximum Intensity Projection | 10.1007/978-3-7091-6803-5_13 | null | false | false | [
"Lukas Mroz",
"Andreas König 0002",
"M. Eduard Gröller"
] | [] | [] | [] |
EuroVis | 1,999 | Skeletal Images as Visual Cues in Graph Visualization | 10.1007/978-3-7091-6803-5_2 | null | false | false | [
"Iván Herman",
"M. Scott Marshall",
"Guy Melançon",
"David J. Duke",
"Maylis Delest",
"Jean-Philippe Domenger"
] | [] | [] | [] |
EuroVis | 1,999 | VISSION: An Object Oriented Dataflow System for Simulation and Visualization | 10.1007/978-3-7091-6803-5_21 | null | false | false | [
"Alexandru C. Telea",
"Jarke J. van Wijk"
] | [] | [] | [] |
EuroVis | 1,999 | Visualization by Examples: Mapping Data to Visual Representations using Few Correspondences | 10.1007/978-3-7091-6803-5_3 | null | false | false | [
"Marc Alexa",
"Wolfgang Müller 0004"
] | [] | [] | [] |
EuroVis | 1,999 | Visualization of Global Flow Structures Using Multiple Levels of Topology | 10.1007/978-3-7091-6803-5_5 | null | false | false | [
"Wim C. de Leeuw",
"Robert van Liere"
] | [] | [] | [] |
EuroVis | 1,999 | Visualization of Grinding Processes | 10.1007/978-3-7091-6803-5_24 | null | false | false | [
"Markus Fiege",
"Gerik Scheuermann",
"Michael Münchhofen",
"Hans Hagen"
] | [] | [] | [] |
EuroVis | 1,999 | Visualization of Molecules with Positional Uncertainty | 10.1007/978-3-7091-6803-5_30 | null | false | false | [
"Penny Rheingans",
"Shrikant Joshi"
] | [] | [] | [] |
EuroVis | 1,999 | VIVENDI - A Virtual Endoscopy System for Virtual Medicine | 10.1007/978-3-7091-6803-5_15 | null | false | false | [
"Dirk Bartz",
"Martin Skalej"
] | [] | [] | [] |
EuroVis | 1,999 | Where Weather Meets the Eye - A Case Study on a Wide Range of Meteorological Visualizations for Diverse Audiences | 10.1007/978-3-7091-6803-5_25 | null | false | false | [
"H. Haase",
"M. Bock",
"Elke Hergenröther",
"Christian Knöpfle",
"Hans-Joachim Koppert",
"Florian Schröder",
"Andrzej Trembilski",
"Jens Weidenhausen"
] | [] | [] | [] |
CHI | 1,999 | Excentric Labeling: Dynamic Neighborhood Labeling for Data Visualization | 10.1145/302979.303148 | The widespread use of information visualization is hampered bythe lack of effective labeling techniques. An informal taxonomy oflabeling methods is proposed. We then describe excentric labeling,a new dynamic technique to label a neighborhood of objects locatedaround the cursor. This technique does not intrude into theexisting interaction, it is not computationally intensive, and waseasily applied to several visualization applications. A pilot studywith eight subjects indicates a strong speed benefit over a zoominterface for tasks that involve the exploration of large numbersof objects. Observations and comments from users are presented. | false | false | [
"Jean-Daniel Fekete",
"Catherine Plaisant"
] | [] | [] | [] |
CHI | 1,999 | The Reader's Helper: A Personalized Document Reading Environment | 10.1145/302979.303139 | Over the last two centuries, reading styles have shifted awayfrom the reading of documents from beginning to end and toward theskimming of documents in search of relevant information. This trendcontinues today where readers, often confronted with aninsurmountable amount of text, seek more efficient methods ofextracting relevant information from documents. In this paper, anew document reading environment is introduced called the ReadersHelperTM, which supports the reading of electronic and paperdocuments. The Readers Helper analyzes documents and produces arelevance score for each of the readers topics of interest, therebyhelping the reader decide whether the document is actually worthskimming or reading. Moreover, during the analysis process, topicof interest phrases are automatically annotated to help the readerquickly locate relevant information. A new informationvisualization tool, called the ThumbarTM, is used in conjunctionwith relevancy scoring and automatic annotation to portray acontinuous, dynamic thumb-nail representation of the document. Thisfurther supports rapid navigation of the text. | false | false | [
"Jamey Graham"
] | [] | [] | [] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.