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 |
|---|---|---|---|---|---|---|---|---|---|---|
InfoVis | 2,001 | Change blindness in information visualization: a case study | 10.1109/INFVIS.2001.963274 | Change blindness occurs when people do not notice changes in visible elements of a scene. If people use an information visualization system to compare document collection subsets partitioned by their time-stamps, change blindness makes it impossible for them to recognize even very major changes, let alone minor ones. We describe theories from cognitive science that account for the change blindness phenomenon, as well as solutions developed for two visual analysis tools, a dot plot (SPIRE Galaxies) and landscape (ThemeView(tm)) visualizations. | false | false | [
"Lucy T. Nowell",
"Elizabeth G. Hetzler",
"Ted Tanasse"
] | [] | [] | [] |
InfoVis | 2,001 | Cluster stability and the use of noise in interpretation of clustering | 10.1109/INFVIS.2001.963275 | A clustering and ordination algorithm suitable for mining extremely large databases, including those produced by microarray expression studies, is described and analyzed for stability. Data from a yeast cell cycle experiment with 6000 genes and 18 experimental measurements per gene are used to test this algorithm under practical conditions. The process of assigning database objects to an X,Y coordinate, ordination, is shown to be stable with respect to random starting conditions, and with respect to minor perturbations in the starting similarity estimates. Careful analysis of the way clusters typically co-locate, versus the occasional large displacements under different starting conditions are shown to be useful in interpreting the data. This extra stability information is lost when only a single cluster is reported, which is currently the accepted practice. However, it is believed that the approaches presented here should become a standard part of best practices in analyzing computer clustering of large data collections. | false | false | [
"George S. Davidson",
"Brian N. Wylie",
"Kevin W. Boyack"
] | [] | [] | [] |
InfoVis | 2,001 | Collapsible cylindrical trees: a fast hierarchical navigation technique | 10.1109/INFVIS.2001.963284 | This paper proposes a new visualization and interaction technique for medium-sized trees, called Collapsible Cylindrical Trees (CCT). Child nodes are mapped on rotating cylinders, which will be dynamically displayed or hidden to achieve a useful balance of detail and context. Besides a comprehensible three-dimensional visualization of trees, the main feature of CCT is a very fast and intuitive interaction with the displayed nodes. Only a single click is needed to reach every node and perform an action on it, such as displaying a web page. The CCT browsing technique was developed for interaction with web hierarchies but is not limited to this domain. We also present sample implementations of CCT using VRML, which show the usefulness of this intuitive tree navigation technique. | false | false | [
"Raimund Dachselt",
"Jürgen Ebert"
] | [] | [] | [] |
InfoVis | 2,001 | Effective graph visualization via node grouping | 10.1109/INFVIS.2001.963280 | We discuss four methodologies for the application of node grouping in graph visualization. In addition, we introduce techniques for force-directed and orthogonal drawing which use node grouping information and have been shown in experiments to perform better than previous techniques. Not only do these techniques have significantly improved performance with respect to standard aesthetic measures, but they also attain qualitative improvement. | false | false | [
"Janet M. Six",
"Ioannis G. Tollis"
] | [] | [] | [] |
InfoVis | 2,001 | Getting along: composition of visualization paradigms | 10.1109/INFVIS.2001.963278 | This paper describes how focus+context techniques can be composed with other high-level visualization paradigms to mutual advantage. Examples are given showing composition both with a pan\&zoom system, and with a treemap implementation. The examples illustrate how focus+context can be used as an exploration and navigation tool within those paradigms. | false | false | [
"Alan Keahey"
] | [] | [] | [] |
InfoVis | 2,001 | Graph sketches | 10.1109/INFVIS.2001.963282 | We introduce the notion of Graph Sketches. They can be thought of as visual indices that guide the navigation of a multi-graph too large to fit on the available display. We adhere to the Visual Information-Seeking Mantra: Overview first, zoom and filter, then details on demand. Graph Sketches are incorporated into MGV, an integrated visualization and exploration system for massive multi-digraph navigation. We highlight the main algorithmic and visualization tasks behind the computation of Graph Sketches and illustrate several application scenarios. Graph Sketches will be used to guide the navigation of multi-digraphs defined on vertex sets with sizes ranging from 100 to 250 million vertices. | false | false | [
"James Abello",
"Irene Finocchi",
"Jeffrey L. Korn"
] | [] | [] | [] |
InfoVis | 2,001 | Graphic data display for cardiovascular system | 10.1109/INFVIS.2001.963295 | Our multi-disciplinary group has developed a visual representation for cardiovascular physiological variables. This enhances a clinician’s ability to detect and rapidly respond to critical events. The integrated and intuitive display communicates a patient’s cardiovascular state so that it is easily and quickly understood without prior training. The display is designed to show patterns of functional relationships that aid in the detection, diagnosis, and treatment of a critical event. | false | false | [
"James Agutter",
"Noah Syroid",
"Frank Drews",
"Dwayne R. Westenskow",
"Julio C. Bermudez",
"David L. Strayer"
] | [] | [] | [] |
InfoVis | 2,001 | Interactive visualization of multiple query results | 10.1109/INFVIS.2001.963287 | This paper introduces a graphical method for visually presenting and exploring the results of multiple queries simultaneously. This method allows a user to visually compare multiple query result sets, explore various combinations among the query result sets, and identify the "best" matches for combinations of multiple independent queries. This approach might also help users explore methods for progressively improving queries by visually comparing the improvement in result sets. | false | false | [
"Susan L. Havre",
"Elizabeth G. Hetzler",
"Kenneth A. Perrine",
"Elizabeth Jurrus",
"Nancy Miller"
] | [] | [] | [] |
InfoVis | 2,001 | Ordered treemap layouts | 10.1109/INFVIS.2001.963283 | Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dynamically changing data, and fail to preserve an ordering of the underlying data. This paper introduces the ordered treemap, which addresses these two shortcomings. The ordered treemap algorithm ensures that items near each other in the given order will be near each other in the treemap layout. Using experimental evidence from Monte Carlo trials, we show that compared to other layout algorithms ordered treemaps are more stable while maintaining relatively favorable aspect ratios of the constituent rectangles. A second test set uses stock market data. | false | false | [
"Ben Shneiderman",
"Martin Wattenberg"
] | [
"TT"
] | [] | [] |
InfoVis | 2,001 | Pixel bar charts: a new technique for visualizing large multi-attribute data sets without aggregation | 10.1109/INFVIS.2001.963288 | Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data and present only a very limited number of data values (as in the case of bar charts). In addition, these graphics may have a high degree of overlap which may occlude a significant portion of the data values (as in the case of the x-y plots). In this paper, we therefore propose a generalization of traditional bar charts and x-y-plots which allows the visualization of large amounts of data. The basic idea is to use the pixels within the bars to present the detailed information of the data records. Our so-called pixel bar charts retain the intuitiveness of traditional bar charts while allowing very large data sets to be visualized in an effective way. We show that, for an effective pixel placement, we have to solve complex optimization problems, and present an algorithm which efficiently solves the problem. Our application using real-world e-commerce data shows the wide applicability and usefulness of our new idea. | false | false | [
"Daniel A. Keim",
"Ming C. Hao",
"Julian Ladisch",
"Meichun Hsu",
"Umeshwar Dayal"
] | [] | [] | [] |
InfoVis | 2,001 | Semantic depth of field | 10.1109/INFVIS.2001.963286 | We present a new technique called Semantic Depth of Field (SDOF) as an alternative approach to focus-and-context displays of information. We utilize a well-known method from photography and cinematography (depth-of-field effect) for information visualization, which is to blur different parts of the depicted scene in dependence of their relevance. Independent of their spatial locations, objects of interest are depicted sharply in SDOF, whereas the context of the visualization is blurred. In this paper, we present a flexible model of SDOF which can be easily adopted to various types of applications. We discuss pros and cons of the new technique, give examples of application, and describe a fast prototype implementation of SDOF. | false | false | [
"Robert Kosara",
"Silvia Miksch",
"Helwig Hauser"
] | [] | [] | [] |
InfoVis | 2,001 | Technical note: visually encoding program test information to find faults in software | 10.1109/INFVIS.2001.963277 | Large test suites are frequently used to evaluate software systems and to locate errors. Unfortunately, this process can generate a huge amount of data that is difficult to interpret manually. We have created a system, Tarantula, that visually encodes test data to help find program errors. The system uses a principled color mapping to represent source lines in passed and failed tests. It also provides a flexible user interface for examining different perspectives that show the behavior of the source code on test sets, ranging from individual tests, to important subsets such as the set of failed tests, to the entire test suite. | false | false | [
"James R. Eagan",
"Mary Jean Harrold",
"James A. Jones",
"John T. Stasko"
] | [] | [] | [] |
InfoVis | 2,001 | To draw a tree | 10.1109/INFVIS.2001.963272 | The quintessential goal of information visualization is depicting abstractions and relations for non-spatial data. A hierarchy is a particularly expressive abstraction that can be applied to a broad range of domains: the genealogical lineages of human descent, the functional decomposition of complex mechanical objects, the classification of knowledge, the evolutionary relationships between species. All of these hierarchical relationships are representable through the abstraction of a recursively defined tree. For this reason, trees occupy a place along with arrays, lists and graphs as one of the most important data structures in computer science. Considering the simple problem of how to effectively draw a tree uncovers many issues fundamental to information visualization. Different drawing styles emphasize different properties of trees, often in subtle ways. I will discuss how people think about trees, and thus what kinds of relationships a tree drawing can usefully convey. My discussion will include a review of many methods for drawing trees, including both historical examples from the sciences and techniques recently developed by researchers in information visualization. | false | false | [
"Pat Hanrahan"
] | [] | [] | [] |
InfoVis | 2,001 | Visualization of state transition graphs | 10.1109/INFVIS.2001.963281 | A new method for the visualization of state transition graphs is presented. Visual information is reduced by clustering nodes, forming a tree structure of related clusters. This structure is visualized in three dimensions with concepts from cone trees and emphasis on symmetry. The resulting visualization makes it easier to relate features in the visualization of the state transition graph to semantic concepts in the corresponding process and | false | false | [
"Frank van Ham",
"Huub van de Wetering",
"Jarke J. van Wijk"
] | [] | [] | [] |
InfoVis | 2,001 | Visualizing time-series on spirals | 10.1109/INFVIS.2001.963273 | In this paper, we present a new approach for the visualization of time-series data based on spirals. Different to classical bar charts and line graphs, the spiral is suited to visualize large data sets and supports much better the identification of periodic structures in the data. Moreover, it supports both the visualization of nominal and quantitative data based on a similar visualization metaphor. The extension of the spiral visualization to 3D gives access to concepts for zooming and focusing and linking in the data set. As such, spirals complement other visualization techniques for time series and specifically enhance the identication of periodic patterns. | false | false | [
"Marc Weber",
"Marc Alexa",
"Wolfgang Müller 0004"
] | [] | [] | [] |
EuroVis | 2,001 | A Case Study in Multi-Sensory Investigation of Geoscientific Data | 10.1007/978-3-7091-6215-6_2 | null | false | false | [
"Chris Harding",
"Ioannis A. Kakadiaris",
"John F. Casey",
"R. Bowen Loftin"
] | [] | [] | [] |
EuroVis | 2,001 | A Hardware-Assisted Visibility-Ordering Algorithm With Applications To Volume Rendering | 10.1007/978-3-7091-6215-6_25 | null | false | false | [
"Shankar Krishnan",
"Cláudio T. Silva",
"Bin Wei"
] | [] | [] | [] |
EuroVis | 2,001 | A Selective Refinement Approach for Computing the Distance Functions of Curves | 10.1007/978-3-7091-6215-6_23 | null | false | false | [
"Daniel E. Laney",
"Mark A. Duchaineau",
"Nelson L. Max"
] | [] | [] | [] |
EuroVis | 2,001 | Acquisition and Display of Real-Time Atmospheric Data on Terrain | 10.1007/978-3-7091-6215-6_3 | null | false | false | [
"Tian-Yue Jiang",
"William Ribarsky",
"Tony Wasilewski",
"Nickolas Faust",
"Brendan Hannigan",
"R. Mitchell Parry"
] | [] | [] | [] |
EuroVis | 2,001 | Adaptive Volume Rendering using Fuzzy Logic Control | 10.1007/978-3-7091-6215-6_27 | null | false | false | [
"Xinyue Li",
"Han-Wei Shen"
] | [] | [] | [] |
EuroVis | 2,001 | Automotive Soiling Simulation Based On Massive Particle Tracing | 10.1007/978-3-7091-6215-6_33 | null | false | false | [
"Stefan Roettger",
"Martin Schulz 0005",
"Wolf Bartelheimer",
"Thomas Ertl"
] | [] | [] | [] |
EuroVis | 2,001 | Case Study: Visualization and Information Retrieval Techniques for Network Intrusion Detection | 10.1007/978-3-7091-6215-6_30 | null | false | false | [
"Travis Atkison",
"Kathleen Pensy",
"Charles K. Nicholas",
"David S. Ebert",
"Rebekah Atkison",
"Chris Morris"
] | [] | [] | [] |
EuroVis | 2,001 | Comparative Visualization of Instabilities in Crash-Worthiness Simulations | 10.1007/978-3-7091-6215-6_34 | null | false | false | [
"Ove Sommer",
"Thomas Ertl"
] | [] | [] | [] |
EuroVis | 2,001 | DDDiver: 3D Interactive Visualization of Entity Relationships | 10.1007/978-3-7091-6215-6_31 | null | false | false | [
"Marc K. D. Coomans",
"Harry J. P. Timmermans"
] | [] | [] | [] |
EuroVis | 2,001 | Extraction of Crack-free Isosurfaces from Adaptive Mesh Refinement Data | 10.1007/978-3-7091-6215-6_4 | null | false | false | [
"Gunther H. Weber",
"Oliver Kreylos",
"Terry J. Ligocki",
"John M. Shalf",
"Hans Hagen",
"Bernd Hamann",
"Kenneth I. Joy"
] | [] | [] | [] |
EuroVis | 2,001 | Fast Multiresolution Extraction of Multiple Transparent Isosurfaces | 10.1007/978-3-7091-6215-6_5 | null | false | false | [
"Thomas Gerstner"
] | [] | [] | [] |
EuroVis | 2,001 | I/O-Conscious Volume Rendering | 10.1007/978-3-7091-6215-6_28 | null | false | false | [
"Chuan-Kai Yang",
"Tzi-cker Chiueh"
] | [] | [] | [] |
EuroVis | 2,001 | Improved visualization in virtual colonoscopy using image-based rendering | 10.1007/978-3-7091-6215-6_15 | null | false | false | [
"Iwo Serlie",
"Frans Vos",
"Rogier E. van Gelder",
"Jaap Stoker",
"Roel Truyen",
"Frans A. Gerritsen",
"C. Yung Nio",
"Frits H. Post"
] | [] | [] | [] |
EuroVis | 2,001 | Interacting with Stock Market Data in a Virtual Environment | 10.1007/978-3-7091-6215-6_29 | null | false | false | [
"Keith Nesbitt"
] | [] | [] | [] |
EuroVis | 2,001 | Interactive and Multi-modal Visualization for Neuroendoscopic Interventions | 10.1007/978-3-7091-6215-6_17 | null | false | false | [
"Dirk Bartz",
"Wolfgang Straßer",
"Özlem Gürvit",
"Dirk Freudenstein",
"Martin Skalej"
] | [] | [] | [] |
EuroVis | 2,001 | Multiresolution Maximum Intensity Volume Rendering by Morphological Pyramids | 10.1007/978-3-7091-6215-6_6 | null | false | false | [
"Jos B. T. M. Roerdink"
] | [] | [] | [] |
EuroVis | 2,001 | Nonlinear Diffusion in Graphics Hardware | 10.1007/978-3-7091-6215-6_9 | null | false | false | [
"Martin Rumpf",
"Robert Strzodka"
] | [] | [] | [] |
EuroVis | 2,001 | Preserving the Mental Map using Foresighted Layout | 10.1007/978-3-7091-6215-6_19 | null | false | false | [
"Stephan Diehl 0001",
"Carsten Görg",
"Andreas Kerren"
] | [] | [] | [] |
EuroVis | 2,001 | Progressive View-Dependent Isosurface Propagation | 10.1007/978-3-7091-6215-6_24 | null | false | false | [
"Zhiyan Liu",
"Adam Finkelstein",
"Kai Li 0001"
] | [] | [] | [] |
EuroVis | 2,001 | Salient Representation of Volume Data | 10.1007/978-3-7091-6215-6_22 | null | false | false | [
"Jirí Hladuvka",
"Andreas König 0002",
"M. Eduard Gröller"
] | [] | [] | [] |
EuroVis | 2,001 | Space-Efficient Boundary Representation of Volumetric Objects | 10.1007/978-3-7091-6215-6_21 | null | false | false | [
"Lukas Mroz",
"Helwig Hauser"
] | [] | [] | [] |
EuroVis | 2,001 | Stream Surface Generation for Fluid Flow Solutions on Curvilinear Grids | 10.1007/978-3-7091-6215-6_11 | null | false | false | [
"Allen Van Gelder"
] | [] | [] | [] |
EuroVis | 2,001 | Subdivision Surfaces for Scattered-data Approximation | 10.1007/978-3-7091-6215-6_7 | null | false | false | [
"Martin Bertram 0001",
"Hans Hagen"
] | [] | [] | [] |
EuroVis | 2,001 | The Rendering of Unstructured Grids Revisited | 10.1007/978-3-7091-6215-6_8 | null | false | false | [
"Rüdiger Westermann"
] | [] | [] | [] |
EuroVis | 2,001 | Three-dimensional Reconstruction and Visualization of the Cerebral Cortex in Primates | 10.1007/978-3-7091-6215-6_16 | null | false | false | [
"Sergio Demelio",
"Fabio Bettio",
"Enrico Gobbetti",
"Giuseppe Luppino"
] | [] | [] | [] |
EuroVis | 2,001 | Topology-Based Visualization of Time-Dependent 2D Vector Fields | 10.1007/978-3-7091-6215-6_13 | null | false | false | [
"Xavier Tricoche",
"Gerik Scheuermann",
"Hans Hagen"
] | [] | [] | [] |
EuroVis | 2,001 | Vector and Tensor Field Topology Simplification on Irregular Grids | 10.1007/978-3-7091-6215-6_12 | null | false | false | [
"Xavier Tricoche",
"Gerik Scheuermann",
"Hans Hagen",
"Stefan Clauss"
] | [] | [] | [] |
EuroVis | 2,001 | Virtual Colon Flattening | 10.1007/978-3-7091-6215-6_14 | null | false | false | [
"Anna Vilanova Bartrolí",
"Rainer Wegenkittl",
"Andreas König 0002",
"M. Eduard Gröller",
"Erich Sorantin"
] | [] | [] | [] |
EuroVis | 2,001 | Visualization of directed associations in e-commerce transaction data | 10.1007/978-3-7091-6215-6_20 | null | false | false | [
"Ming C. Hao",
"Umeshwar Dayal",
"Meichun Hsu",
"Thomas C. Sprenger",
"Markus H. Gross"
] | [] | [] | [] |
EuroVis | 2,001 | Visualization of Generalized Voronoi Diagrams | 10.1007/978-3-7091-6215-6_18 | null | false | false | [
"Alexandru C. Telea",
"Jarke J. van Wijk"
] | [] | [] | [] |
EuroVis | 2,001 | Visualization of Thermal Flows in an Automotive Cabin with Volume Rendering Method | 10.1007/978-3-7091-6215-6_32 | null | false | false | [
"Kenji Ono",
"Hideki Matsumoto",
"Ryutaro Himeno"
] | [] | [] | [] |
EuroVis | 2,001 | Volume Rendering Data with Uncertainty Information | 10.1007/978-3-7091-6215-6_26 | null | false | false | [
"Suzana Djurcilov",
"Kwansik Kim",
"Pierre F. J. Lermusiaux",
"Alex Pang"
] | [] | [] | [] |
EuroVis | 2,001 | Voxel Column Culling: Occlusion Culling for Large Terrain Models | 10.1007/978-3-7091-6215-6_10 | null | false | false | [
"Brian Zaugg",
"Parris K. Egbert"
] | [] | [] | [] |
CHI | 2,001 | 3D or not 3D? evaluating the effect of the third dimension in a document management system | 10.1145/365024.365309 | Several recent research systems have provided interactive three-dimensional (3D) visualisations for supporting everyday work such as file and document management. But what improvements do these 3D interfaces offer over their traditional 2D counterparts? This paper describes the comparative evaluation of two document management systems that differ only in the number of dimensions used for displaying and interacting with the data. The 3D system is heavily based on Robertson et al.'s Data Mountain, which supports users in storing, organising and retrieving “thumbnail” representations of documents such as bookmarked Web-pages. Results show that our subjects were faster at storing and retrieving pages in the display when using the 2D interface, but not significantly so. As expected, retrieval times significantly increased as the number of thumbnails increased. Despite the lack of significant differences between the 2D and 3D interfaces, subjective assessments showed a significant preference for the 3D interface. | false | false | [
"Andy Cockburn",
"Bruce J. McKenzie"
] | [] | [] | [] |
CHI | 2,001 | Digital family portraits: supporting peace of mind for extended family members | 10.1145/365024.365126 | A growing social problem in the U.S., and elsewhere, is supporting older adults who want to continue living independently, as opposed to moving to an institutional care setting. One key part of this complex problem is providing awareness of senior adults day-to-day activities, promoting peace of mind for extended family members. In this paper, we introduce the concept of a digital family portrait that provides qualitative visualizations of a family members daily life. Leveraging a familiar household object, the picture frame, our design populates the frame with iconic imagery summarizing 28 days. In a final implementation, the digital family portrait would gather information from sensors in the home. | false | false | [
"Elizabeth D. Mynatt",
"Jim Rowan",
"Sarah Craighill",
"Annie Jacobs"
] | [] | [] | [] |
CHI | 2,001 | Information scent as a driver of Web behavior graphs: results of a protocol analysis method for Web usability | 10.1145/365024.365331 | The purpose of this paper is to introduce a replicable WWW protocol analysis methodology illustrated by application to data collected in the laboratory. The methodology uses instrumentation to obtain detailed recordings of user actions with a browser, caches Web pages encoutered, and videotapes talk-aloud protocols. We apply the current form of the method to the analysis of eight Web protocols, visualizing the structure of the interaction and showing the strong effect of information scent in determining the path followed. | false | false | [
"Stuart K. Card",
"Peter Pirolli",
"Mija M. Van Der Wege",
"Julie Bauer Morrison",
"Robert W. Reeder",
"Pamela K. Schraedley",
"Jenea Boshart"
] | [] | [] | [] |
CHI | 2,001 | Visual information foraging in a focus + context visualization | 10.1145/365024.365337 | Eye tracking studies of the Hyperbolic Tree browser [10] suggest that visual search in focus+context displays is highly affected by information scent (i.e., local cues, such as text summaries, used to assess and navigate toward distal information sources). When users detected a strong information scent, they were able to reach their goal faster with the Hyperbolic Tree browser than with a conventional browser. When users detected a weak scent or no scent, users exhibited less efficient search of areas with a high density of visual items. In order to interpret these results we present an integration of the CODE Theory of Visual Attention (CTVA) with information foraging theory. Development of the CTVA-foraging theory could lead to deeper analysis of interaction with visual displays of content, such as the World Wide Web or information visualizations. | false | false | [
"Peter Pirolli",
"Stuart K. Card",
"Mija M. Van Der Wege"
] | [] | [] | [] |
CHI | 2,001 | Visualization components for persistent conversations | 10.1145/365024.365073 | An appropriately designed interface to persistent, threaded conversations could reinforce socially beneficial behavior by prominently featuring how frequently and to what degree each user exhibits such behaviors. Based on the data generated by the Netscan data-mining project [9], we have developed a set of tools for illustrating the structure of discussion threads like those found in Usenet newsgroups and the patterns of participation within the discussions. We describe the benefits and challenges of integrating these tools into a multi-faceted dashboard for navigating and reading discussions in social cyberspaces like Usenet and related interaction media. Visualizations of the structure of online discussions have applications for research into the sociology of online groups as well as possible interface designs for their members. | false | false | [
"Marc A. Smith",
"Andrew T. Fiore"
] | [] | [] | [] |
Vis | 2,000 | 3D digital cleansing using segmentation rays | 10.1109/VISUAL.2000.885674 | We propose a novel approach for segmentation and digital cleansing of endoscopic organs. Our method can be used for a variety of segmentation needs with little or no modification. It aims at fulfilling the dual and often conflicting requirements of a fast and accurate segmentation and also eliminates the undesirable partial volume effect which contemporary approaches cannot. For segmentation and digital cleansing, we use the peculiar characteristics exhibited by the intersection of any two distinct-intensity regions. To detect these intersections we cast rays through the volume, which we call the segmentation rays as they assist in the segmentation. We then associate a certain task of reconstruction and classification with each intersection the ray detects. We further use volumetric contrast enhancement to reconstruct surface lost by segmentation (if any), which aids in improving the quality of the volume rendering. | false | false | [
"Sarang Lakare",
"Ming Wan",
"Mie Sato",
"Arie E. Kaufman"
] | [] | [] | [] |
Vis | 2,000 | A computational steering system for studying microwave interactions with missile bodies | 10.1109/VISUAL.2000.885727 | The paper describes a computer modeling and simulation system that supports computational steering, which is an effort to make the typical simulation workflow more efficient. Our system provides an interface that allows scientists to perform all of the steps in the simulation process in parallel and online. It uses a standard network flow visualization package, which has been extended to display graphical output in an immersive virtual environment such as a CAVE. Our system allows scientists to interactively manipulate simulation parameters and observe the results. It also supports inverse steering, where the user specifies the desired simulation result, and the system searches for the simulation parameters that achieve this result. Taken together, these capabilities allow scientists to more efficiently and effectively understand model behavior, as well as to search through simulation parameter space. The paper is also a case study of applying our system to the problem of simulating microwave interactions with missile bodies. Because these interactions are difficult to study experimentally, and have important effects on missile electronics, there is a strong desire to develop and validate simulation models of this phenomena. | false | false | [
"J. Edward Swan II",
"Marco Lanzagorta",
"Doug Maxwell",
"Eddy Kuo",
"Jeffrey Uhlmann",
"Wendell Anderson",
"Haw-Jye Shyu",
"William Smith"
] | [] | [] | [] |
Vis | 2,000 | A continuous clustering method for vector fields | 10.1109/VISUAL.2000.885715 | A new method for the simplification of flow fields is presented. It is based on continuous clustering. A well-known physical clustering model, the Cahn Hilliard model (J. Cahn and J. Hilliard, 1958), which describes phase separation, is modified to reflect the properties of the data to be visualized. Clusters are defined implicitly as connected components of the positivity set of a density function. An evolution equation for this function is obtained as a suitable gradient flow of an underlying anisotropic energy functional. Here, time serves as the scale parameter. The evolution is characterized by a successive coarsening of patterns: the actual clustering, and meanwhile the underlying simulation data specifies preferable pattern boundaries. The authors discuss the applicability of this new type of approach mainly for flow fields, where the cluster energy penalizes cross streamline boundaries, but the method also carries provisions in other fields as well. The clusters are visualized via iconic representations. A skeletonization algorithm is used to find suitable positions for the icons. | false | false | [
"Harald Garcke",
"Tobias Preußer",
"Martin Rumpf",
"Alexandru C. Telea",
"Ulrich Weikard",
"Jarke J. van Wijk"
] | [] | [] | [] |
Vis | 2,000 | A flow-guided streamline seeding strategy | 10.1109/VISUAL.2000.885690 | The paper presents a seed placement strategy for streamlines based on flow features in the dataset. The primary goal of our seeding strategy is to capture flow patterns in the vicinity of critical points in the flow field, even as the density of streamlines is reduced. Secondary goals are to place streamlines such that there is sufficient coverage in non-critical regions, and to vary the streamline placements and lengths so that the overall presentation is aesthetically pleasing (avoid clustering of streamlines, avoid sharp discontinuities across several streamlines, etc.). The procedure is straightforward and non-iterative. First, critical points are identified. Next, the flow field is segmented into regions, each containing a single critical point. The critical point in each region is then seeded with a template depending on the type of critical point. Finally, additional seed points are randomly distributed around the field using a Poisson disk distribution to minimize closely spaced seed points. The main advantage of this approach is that it does not miss the features around critical points. Since the strategy is not image-guided, and hence not view dependent, significant savings are possible when examining flow fields from different viewpoints, especially for 3D flow fields. | false | false | [
"Vivek Verma",
"David L. Kao",
"Alex T. Pang"
] | [
"TT"
] | [] | [] |
Vis | 2,000 | A level-set method for flow visualization | 10.1109/VISUAL.2000.885688 | We propose a technique for visualizing steady flow. Using this technique, we first convert the vector field data into a scalar level-set representation. We then analyze the dynamic behavior and subsequent distortion of level-sets and interactively monitor the evolving structures by means of texture-based surface rendering. Next, we combine geometrical and topological considerations to derive a multiscale representation and to implement a method for the automatic placement of a sparse set of graphical primitives depicting homogeneous streams in the fields. Using the resulting algorithms, we have built a visualization system that enables us to effectively display the flow direction and its dynamics even for dense 3D fields. | false | false | [
"Rüdiger Westermann",
"Christopher R. Johnson 0001",
"Thomas Ertl"
] | [] | [] | [] |
Vis | 2,000 | A spreadsheet interface for visualization exploration | 10.1109/VISUAL.2000.885678 | As the size and complexity of data sets continues to increase, the development of user interfaces and interaction techniques that expedite the process of exploring that data must receive new attention. Regardless of the speed of rendering, it is important to coherently organize the visual process of exploration: this information both grants insights about the data to a user and can be used by collaborators to understand the results. To fulfil these needs, we present a spreadsheet-like interface to data exploration. The interface displays a 2-dimensional window into visualization parameter space which users manipulate as they search for desired results. Through tabular organization and a clear correspondence between parameters and results, the interface eases the discovery, comparison and analysis of the underlying data. Users can utilize operators and the integrated interpreter to further explore and automate the visualization process; using a method introduced in this paper, these operations can be applied to cells in different stacks of the interface. Via illustrations using a variety of data sets, we demonstrate the efficacy of this novel interface. | false | false | [
"T. J. Jankun-Kelly",
"Kwan-Liu Ma"
] | [] | [] | [] |
Vis | 2,000 | A topology simplification method for 2D vector fields | 10.1109/VISUAL.2000.885716 | Topology analysis of plane, turbulent vector fields results in visual clutter caused by critical points indicating vortices of finer and finer scales. A simplification can be achieved by merging critical points within a prescribed radius into higher order critical points. After building clusters containing the singularities to merge, the method generates a piecewise linear representation of the vector field in each cluster containing only one (higher order) singularity. Any visualization method can be applied to the result after this process. Using different maximal distances for the critical points to be merged results in a hierarchy of simplified vector fields that can be used for analysis on different scales. | false | false | [
"Xavier Tricoche",
"Gerik Scheuermann",
"Hans Hagen"
] | [] | [] | [] |
Vis | 2,000 | A visibility determination algorithm for interactive virtual endoscopy | 10.1109/VISUAL.2000.885673 | We present a new visibility determination algorithm for interactive virtual endoscopy. The algorithm uses a modified version of template-based ray casting to extract a view dependent set of potentially visible voxels from volume data. The voxels are triangulated by Marching Cubes and the triangles are rendered onto the display by a graphics accelerator. Early ray termination and space leaping are used to accelerate the ray casting step and a quadtree subdivision algorithm is used to reduce the number of cast rays. Compared to other recently proposed rendering algorithms for virtual endoscopy, our rendering algorithm does not require a long preprocessing step or a high-end graphics workstation, but achieves interactive frame rates on a standard PC equipped with a low-cost graphics accelerator. | false | false | [
"Rami Hietala",
"Jarkko Oikarinen"
] | [] | [] | [] |
Vis | 2,000 | Achieving color uniformity across multi-projector displays | 10.1109/VISUAL.2000.885684 | Large area tiled displays are gaining popularity for use in collaborative immersive virtual environments and scientific visualization. While recent work has addressed the issues of geometric registration, rendering architectures, and human interfaces, there has been relatively little work on photometric calibration in general, and photometric non-uniformity in particular. For example, as a result of differences in the photometric characteristics of projectors, the color and intensity of a large area display varies from place to place. Further, the imagery typically appears brighter at the regions of overlap between adjacent projectors. We analyze and classify the causes of photometric non-uniformity in a tiled display. We then propose a methodology for determining corrections designed to achieve uniformity, that can correct for the photometric variations across a tiled projector display in real time using per channel color look-up-tables (LUT). | false | false | [
"Aditi Majumder",
"Zhu He",
"Herman Towles",
"Greg Welch"
] | [] | [] | [] |
Vis | 2,000 | An integrated visualization and design toolkit for flexible prosthetic heart valves | 10.1109/VISUAL.2000.885730 | We describe a toolkit for the design and visualization of flexible artificial heart valves. The toolkit consists of interlinked modules with a visual programming interface. The user of the toolkit can set the initial geometry and material properties of the valve leaflet, solve for the flexing of the leaflet and the flow of blood around it, and display the results using the visualization capabilities of the toolkit. The interactive nature of our environment is highlighted by the fact that changes in leaflet properties are immediately reflected in the flow field and response of the leaflet. Hence the user may, in a single session, investigate a broad range of designs, each one of which provides important information about the blood flow and motion of the valve during the cardiac cycle. | false | false | [
"A. J. Fenlon",
"T. David",
"J. P. R. B. Walton"
] | [] | [] | [] |
Vis | 2,000 | Anisotropic geometric diffusion in surface processing | 10.1109/VISUAL.2000.885721 | A new multiscale method in surface processing is presented which combines the image processing methodology based on nonlinear diffusion equations and the theory of geometric evolution problems. Its aim is to smooth discretized surfaces while simultaneously enhancing geometric features such as edges and corners. This is obtained by an anisotropic curvature evolution, where time is the multiscale parameter. Here, the diffusion tensor depends on the shape operator of the evolving surface. A spatial finite element discretization on arbitrary unstructured triangular meshes and a semi-implicit finite difference discretization in time are the building blocks of the easy to code algorithm presented. The systems of linear equations in each timestep are solved by appropriate, preconditioned iterative solvers. Different applications underline the efficiency and flexibility of the presented type of surface processing tool. | false | false | [
"Ulrich Clarenz",
"Udo Diewald",
"Martin Rumpf"
] | [] | [] | [] |
Vis | 2,000 | Automatic alignment of high-resolution multi-projector displays using an uncalibrated camera | 10.1109/VISUAL.2000.885685 | A scalable, high-resolution display may be constructed by tiling many projected images over a single display surface. One fundamental challenge for such a display is to avoid visible seams due to misalignment among the projectors. Traditional methods for avoiding seams involve sophisticated mechanical devices and expensive CRT projectors, coupled with extensive human effort for fine-tuning the projectors. The paper describes an automatic alignment method that relies on an inexpensive, uncalibrated camera to measure the relative mismatches between neighboring projectors, and then correct the projected imagery to avoid seams without significant human effort. | false | false | [
"Yuqun Chen",
"Douglas W. Clark",
"Adam Finkelstein",
"Timothy C. Housel",
"Kai Li 0001"
] | [] | [] | [] |
Vis | 2,000 | Basic research for coloring multichannel MRI data | 10.1109/VISUAL.2000.885693 | This is basic research for assigning color values to voxels of multichannel MRI volume data. The MRI volume data sets obtained under different scanning conditions are transformed into their components by independent component analysis (ICA), which enhances the physical characteristics of the tissue. The transfer functions for generating color values from independent components are obtained using a radial basis function network, a kind of neural net, by training the network with sample data chosen from the Visible Female data set. The resultant color volume data sets correspond well with the full-color cross-sections of the Visible Human data sets. | false | false | [
"Shigeru Muraki",
"Toshiharu Nakai",
"Yasuyo Kita"
] | [] | [] | [] |
Vis | 2,000 | Bicubic subdivision-surface wavelets for large-scale isosurface representation and visualization | 10.1109/VISUAL.2000.885720 | We introduce a new subdivision-surface wavelet transform for arbitrary two-manifolds with boundary that is the first to use simple lifting-style filtering operations with bicubic precision. We also describe a conversion process for re-mapping large-scale isosurfaces to have subdivision connectivity and fair parameterizations so that the new wavelet transform can be used for compression and visualization. The main idea enabling our wavelet transform is the circular symmetrization of the filters in irregular neighborhoods, which replaces the traditional separation of filters into two 1D passes. Our wavelet transform uses polygonal base meshes to represent surface topology, from which a Catmull-Clark-style subdivision hierarchy is generated. The details between these levels of resolution are quickly computed and compactly stored as wavelet coefficients. The isosurface conversion process begins with a contour triangulation computed using conventional techniques, which we subsequently simplify with a variant edge-collapse procedure, followed by an edge-removal process. This provides a coarse initial base mesh, which is subsequently refined, relaxed and attracted in phases to converge to the contour. The conversion is designed to produce smooth, untangled and minimally-skewed parameterizations which improves the subsequent compression after applying the transform. We have demonstrated our conversion and transform for an isosurface obtained from a high-resolution turbulent-mixing hydrodynamics simulation, showing the potential for compression and level-of-detail visualization. | false | false | [
"Martin Hering-Bertram",
"Mark A. Duchaineau",
"Bernd Hamann",
"Kenneth I. Joy"
] | [] | [] | [] |
Vis | 2,000 | Case study: a methodology for plume visualization with application to real-time acquisition and navigation | 10.1109/VISUAL.2000.885737 | Applications of visualization techniques that facilitate comparison of simulation and field datasets of seafloor hydrothermal plumes are demonstrated in order to explore and confirm theories of plume behavior. In comparing these datasets, there is no one-to-one correspondence. We show the comparison by performing quantitative capturing of large scale observable features. The comparisons are needed not only to improve the relevance of the simulations to the field observations, but also to enable real time adjustment of shipboard data collection systems. Our approach for comparing simulation and field datasets is to use skeletonization and centerline representation. Features representing plumes are skeletonized. Skeleton points are used to construct a centerline and to quantify plume properties on planes normal to the centerline. These skeleton points are further used to construct an idealized cone representing a plume isosurface. The difference between the plume feature and the cone is identified as protrusions of turbulent eddies. Comparison of the simulation and field data sets through these abstractions illustrates how these abstractions characterize a plume. | false | false | [
"Karen G. Bemis",
"Deborah Silver",
"Peter A. Rona",
"Chengwei Feng"
] | [] | [] | [] |
Vis | 2,000 | CEASAR: a smooth, accurate and robust centerline extraction algorithm | 10.1109/VISUAL.2000.885675 | We present CEASAR, a centerline extraction algorithm that delivers smooth, accurate and robust results. Centerlines are needed for accurate measurements of length along winding tubular structures. Centerlines are also required in automatic virtual navigation through human organs, such as the colon or the aorta, as they are used to control movement and orientation of the virtual camera. We introduce a concise but general definition of a centerline, and provide an algorithm that finds the centerline accurately and rapidly. Our algorithm is provably correct for general geometries. Our solution is fully automatic, which frees the user from having to engage in data preprocessing. For a number of test datasets, we show the smooth and accurate centerlines computed by our CEASAR algorithm on a single 194 MHz MIPS R10000 CPU within five minutes. | false | false | [
"Ingmar Bitter",
"Mie Sato",
"Michael A. Bender",
"Kevin T. McDonnell",
"Arie E. Kaufman",
"Ming Wan"
] | [] | [] | [] |
Vis | 2,000 | Combining local and remote visualization techniques for interactive volume rendering in medical applications | 10.1109/VISUAL.2000.885729 | For a comprehensive understanding of tomographic image data in medicine, interactive and high-quality direct volume rendering is an essential prerequisite. This is provided by visualization using 3D texture mapping which is still limited to high-end graphics hardware. In order to make it available in a clinical environment, we present a system which uniquely combines local desktop computers and remote high-end graphics hardware. In this context, we exploit the standard visualization capabilities to a maximum which are available in the clinical environment. For 3D representations of high resolution and quality we access the remote specialized hardware. Various tools for 2D and 3D visualization are provided which meet the requirements of a medical diagnosis. This is demonstrated with examples from the field of neuroradiology which show the value of our strategy in practice. | false | false | [
"Klaus Engel",
"Thomas Ertl",
"Peter Hastreiter",
"Bernd Tomandl",
"K. Eberhardt"
] | [] | [] | [] |
Vis | 2,000 | Constructing material interfaces from data sets with volume-fraction information | 10.1109/VISUAL.2000.885717 | We present a new algorithm for material boundary interface reconstruction from data sets containing volume fractions. We transform the reconstruction problem to a problem that analyzes the dual data set, where each vertex in the dual mesh has an associated barycentric coordinate tuple that represents the fraction of each material present. After constructing the dual tetrahedral mesh from the original mesh, we construct material boundaries by mapping a tetrahedron into barycentric space and calculating the intersections with Voronoi cells in barycentric space. These intersections are mapped back to the original physical space and triangulated to form the boundary surface approximation. This algorithm can be applied to any grid structure and can treat any number of materials per element/vertex. | false | false | [
"Kathleen S. Bonnell",
"Kenneth I. Joy",
"Bernd Hamann",
"Daniel Schikore",
"Mark A. Duchaineau"
] | [] | [] | [] |
Vis | 2,000 | Creating reusable visualizations with the relational visualization notation | 10.1109/VISUAL.2000.885676 | Richly expressive information visualizations are difficult to design and rarely found. Few software tools can generate multidimensional visualizations at all, let alone incorporate artistic detail. Although, it is a great efficiency to reuse these visualizations with new data, the associated artistic detail is rarely reusable. The Relational Visualization Notation is a new technique and toolkit for specifying highly expressive graphical representations of data without traditional programming. We seek to discover the accessible power of this notation, both its graphical expressiveness and its ease of re-use. Towards this end we have used the system to reconstruct Minard's visualization of Napoleon's Russian campaign of 1812. The resulting image is strikingly similar to the original, and the design is straightforward to construct. Furthermore, the design permitted by the notation can be directly reused to visualize Hitler's WWII defeat before Moscow. This experience leads us to believe that artistically expressive visualizations can be made to be reusable. | false | false | [
"Matthew C. Humphrey"
] | [] | [] | [] |
Vis | 2,000 | Enabling level-of-detail matching for exterior scene synthesis | 10.1109/VISUAL.2000.885691 | The work presents a method to enable matching of level-of-detail (LOD) models to image-plane resolution over large variations in viewing distances often present in exterior images. A relationship is developed between image sampling rate, viewing distance, object projection, and expected image error due to LOD approximations. This is employed in an error metric to compute error profiles for LOD models. Multirate filtering in the frequency space of a reference object image is utilized to approximate multiple distant views over a range of orientations. An importance sampling method is described to better characterize perspective projection over view distance. A contrast sensitivity function (CSF) is employed to approximate the response of the vision system. Examples are presented for multiresolution spheres and a terrain height field feature. Future directions for extending this method are described. | false | false | [
"Randy K. Scoggins",
"Robert J. Moorhead II",
"Raghu Machiraju"
] | [] | [] | [] |
Vis | 2,000 | Extracting regions of interest applying a local watershed transformation | 10.1109/VISUAL.2000.885672 | We present a new technique for extracting regions of interest (ROI) applying a local watershed transformation. The proposed strategy for computing catchment basins in a given region of interest is based on a rain-falling simulation. Unlike the standard watershed algorithms, which flood the complete (gradient magnitude of an) image, the proposed approach allows us to perform this task locally. Thus, a controlled region growth is performed, saving time and reducing the memory requirement especially when applied on volume data. A second problem arising from the standard watershed transformation is the over-segmented result and the lack of sound criteria for merging the computed basins. For overcoming this drawback, we present a basin-merging strategy introducing four criteria for merging adjacent basins. The threshold values applied in this strategy are derived from the user input and match rather the attributes of the selected object than of all objects in the image. In doing so, the user is not required to adjust abstract numbers, but to simply select a coarse region of interest. Moreover, the proposed algorithm is not limited to the 2D case. As we show in this work, it is suitable for volume data processing as well. Finally, we present the results of applying the proposed approach on several example images and volume data sets. | false | false | [
"Stanislav L. Stoev",
"Wolfgang Straßer"
] | [] | [] | [] |
Vis | 2,000 | Fairing of non-manifolds for visualization | 10.1109/VISUAL.2000.885722 | The concept of fairing applied to irregular triangular meshes has become more and more important. Previous contributions constructed better fairing operators, and applied them both to multiresolution editing tools and to multiresolution representations of meshes. The authors generalize these powerful techniques to handle non-manifold models. Our framework computes a multilevel fairing of models by fairing both the two-manifold surfaces that define the model, the so-called two-features, and all the boundary and intersection curves of the model, the so-called one-features. In addition we introduce two extensions that can be used in our framework as well as in manifold fairing concepts: an exact local volume preservation strategy and a method for feature preservation. Our framework works with any of the manifold fairing operators for meshes. | false | false | [
"Andreas Hubeli",
"Markus H. Gross"
] | [] | [] | [] |
Vis | 2,000 | Fast visualization methods for comparing dynamics: a case study in combustion | 10.1109/VISUAL.2000.885725 | Visualization can be an important tool for displaying, categorizing and digesting large quantities of inter-related information during laboratory and simulation experiments. Summary visualizations that compare and represent data sets in the context of a collection are particularly valuable. Applicable visualizations used in these settings must be fast (near real time) and should allow the addition of data sets as they are acquired without requiring rerendering of the visualization. This paper examines several visualization techniques for representing collections of data sets in a combustion experiment including spectral displays, tiling and geometric mappings of symmetry. The application provides insight into how such visualizations might be used in practical real-time settings to assist in exploration and in conducting parameter space surveys. | false | false | [
"Kay A. Robbins",
"Michael Gorman"
] | [] | [] | [] |
Vis | 2,000 | FastSplats: optimized splatting on rectilinear grids | 10.1109/VISUAL.2000.885698 | Splatting is widely applied in many areas, including volume, point-based and image-based rendering. Improvements to splatting, such as eliminating popping and color bleeding, occasion-based acceleration, post-rendering classification and shading, have all been recently accomplished. These improvements share a common need for efficient frame-buffer accesses. We present an optimized software splatting package, using a newly designed primitive, called FastSplat, to scan-convert footprints. Our approach does not use texture mapping hardware, but supports the whole pipeline in memory. In such an integrated pipeline, we are then able to study the optimization strategies and address image quality issues. While this research is meant for a study of the inherent trade-off of splatting, our renderer, purely in software, achieves 3- to 5-fold speedups over a top-end texture hardware implementation (for opaque data sets). We further propose a method of efficient occlusion culling using a summed area table of opacity. 3D solid texturing and bump mapping capabilities are demonstrated to show the flexibility of such an integrated rendering pipeline. A detailed numerical error analysis, in addition to the performance and storage issues, is also presented. Our approach requires low storage and uses simple operations. Thus, it is easily implementable in hardware. | false | false | [
"Jian Huang",
"Roger Crawfis",
"Naeem Shareef",
"Klaus Mueller 0001"
] | [] | [] | [] |
Vis | 2,000 | Four-dimensional non-linear ray tracing as a visualization tool for gravitational physics | 10.1109/VISUAL.2000.885728 | General relativistic ray tracing is presented as a tool for gravitational physics. It is shown how standard three-dimensional ray tracing can be extended to allow for general relativistic visualization. This visualization technique provides images as seen by an observer under the influence of a gravitational field and allows to probe space-time by null geodesics. Moreover, a technique is proposed for visualizing the caustic surfaces generated by a gravitational lens. The suitability of general relativistic ray tracing is demonstrated by means of two examples, namely the visualization of the rigidly rotating disk of dust and the warp drive metric. | false | false | [
"Daniel Weiskopf"
] | [] | [] | [] |
Vis | 2,000 | Geometric compression for interactive transmission | 10.1109/VISUAL.2000.885711 | The compression of geometric structures is a relatively new field of data compression. Since about 1995, several articles have dealt with the coding of meshes, using for most of them the following approach: the vertices of the mesh are coded in an order that partially contains the topology of the mesh. In the same time, some simple rules attempt to predict the position of each vertex from the positions of its neighbors that have been previously coded. We describe a compression algorithm whose principle is completely different: the coding order of the vertices is used to compress their coordinates, and then the topology of the mesh is reconstructed from the vertices. This algorithm achieves compression ratios that are slightly better than those of the currently available algorithms, and moreover, it allows progressive and interactive transmission of the meshes. | false | false | [
"Olivier Devillers",
"Pierre-Marie Gandoin"
] | [] | [] | [] |
Vis | 2,000 | H-BLOB: a hierarchical visual clustering method using implicit surfaces | 10.1109/VISUAL.2000.885677 | We present a new hierarchical clustering and visualization algorithm called H-BLOB, which groups and visualizes cluster hierarchies at multiple levels-of-detail. Our method is fundamentally different to conventional clustering algorithms, such as C-means, K-means, or linkage methods that are primarily designed to partition a collection of objects into subsets sharing similar attributes. These approaches usually lack an efficient level-of-detail strategy that breaks down the visual complexity of very large datasets for visualization. In contrast, our method combines grouping and visualization in a two stage process constructing a hierarchical setting. In the first stage a cluster tree is computed making use of an edge contraction operator. Exploiting the inherent hierarchical structure of this tree, a second stage visualizes the clusters by computing a hierarchy of implicit surfaces. We believe that H-BLOB is especially suited for the visualization of very large datasets and for visual decision making in information visualization. The versatility of the algorithm is demonstrated using examples from visual data mining. | false | false | [
"Thomas C. Sprenger",
"R. Brunella",
"Markus H. Gross"
] | [] | [] | [] |
Vis | 2,000 | Hardware-accelerated texture advection for unsteady flow visualization | 10.1109/VISUAL.2000.885689 | We present a novel hardware-accelerated texture advection algorithm to visualize the motion of two-dimensional unsteady flows. Making use of several proposed extensions to the OpenGL-1.2 specification, we demonstrate animations of over 65,000 particles at 2 frames/sec on an SGI Octane with EMXI graphics. High image quality is achieved by careful attention to edge effects, noise frequency, and image enhancement. We provide a detailed description of the hardware implementation, including temporal and spatial coherence techniques, dye advection techniques, and feature extraction. | false | false | [
"Bruno Jobard",
"Gordon Erlebacher",
"M. Yousuff Hussaini"
] | [] | [] | [] |
Vis | 2,000 | Hardware-accelerated volume and isosurface rendering based on cell-projection | 10.1109/VISUAL.2000.885683 | We present two beneficial rendering extensions to the projected tetrahedra (PT) algorithm proposed by Shirley and Tuchman (1990). These extensions are compatible with any cell sorting technique, for example the BSP-XMPVO sorting algorithm for unstructured meshes. Using 3D texture mapping our first extension solves the longstanding problem of hardware-accelerated but accurate rendering of tetrahedral volume cells with arbitrary transfer functions. By employing 2D texture mapping our second extension realizes the hardware-accelerated rendering of multiple shaded isosurfaces within the PT algorithm without reconstructing the isosurfaces. Additionally, two methods are presented to combine projected tetrahedral volumes with isosurfaces. The time complexity of all our algorithms is linear in the number of tetrahedra and does neither depend on the number of isosurfaces nor on the employed transfer functions. | false | false | [
"Stefan Röttger",
"Martin Kraus",
"Thomas Ertl"
] | [] | [] | [] |
Vis | 2,000 | Image based rendering with stable frame rates | 10.1109/VISUAL.2000.885702 | Presents an efficient keyframeless image-based rendering technique. An intermediate image is used to exploit the coherences among neighboring frames. The pixels in the intermediate image are first rendered by a ray-casting method and then warped to the intermediate image at the current viewpoint and view direction. We use an offset buffer to record the precise positions of these pixels in the intermediate image. Every frame is generated in three steps: warping the intermediate image onto the frame, filling in holes, and selectively rendering a group of "old" pixels. By dynamically adjusting the number of those "old" pixels in the last step, the workload at every frame can be balanced. The pixels generated by the last two steps make contributions to the new intermediate image. Unlike occasional keyframes in conventional image-based rendering, which need to be totally re-rendered, intermediate images only need to be partially updated at every frame. In this way, we guarantee more stable frame rates and more uniform image qualities. The intermediate image can be warped efficiently by a modified incremental 3D warp algorithm. As a specific application, we demonstrate our technique with a voxel-based terrain rendering system. | false | false | [
"Huamin Qu",
"Ming Wan",
"Jiafa Qin",
"Arie E. Kaufman"
] | [] | [] | [] |
Vis | 2,000 | Immersive virtual reality for visualizing flow through an artery | 10.1109/VISUAL.2000.885731 | We present an immersive system for exploring numerically simulated flow data through a model of a coronary artery graft. This tightly-coupled interdisciplinary project is aimed at understanding how to reduce the failure rate of these grafts. The visualization system provides a mechanism for exploring the effect of changes to the geometry, to the flow, and for exploring potential sources of future lesions. The system uses gestural and voice interactions exclusively, moving away from more traditional windows/icons/menus/point-and-click (WIMP) interfaces. We present an example session using the system and discuss our experiences developing, testing, and using it. We describe some of the interaction and rendering techniques that we experimented with and describe their level of success. Our experience suggests that systems like this are exciting to clinical researchers, but conclusive evidence of their value is not yet available. | false | false | [
"Andrew S. Forsberg",
"David H. Laidlaw",
"Andries van Dam",
"Robert M. Kirby",
"George Em Karniadakis",
"Jonathan L. Elion"
] | [] | [] | [] |
Vis | 2,000 | Interactive visualization of particle-in-cell simulations | 10.1109/VISUAL.2000.885734 | The authors present a visualization system for interactive real time animation and visualization of simulation results from a parallel Particle-in-Cell code. The system was designed and implemented for the Onyx2 Infinite Reality hardware. A number of different visual objects, such as volume rendered particle density functionals were implemented. To provide sufficient frame rates for interactive visualization, the system was designed to provide performance close to the hardware specifications both in terms of the I/O and graphics subsystems. The presented case study applies the developed system to the evolution of an instability that gives rise to a plasma surfatron, a mechanism which rapidly can accelerate particles to very high velocities and thus be of great importance in the context of electron acceleration in astrophysical shocks, in the solar corona and in particle accelerators. The produced visualizations have allowed us to identify a previously unknown saturation mechanism for the surfatron and direct research efforts into new areas of interest. | false | false | [
"Patric Ljung",
"Mark Dieckmann",
"Niclas Andersson",
"Anders Ynnerman"
] | [] | [] | [] |
Vis | 2,000 | Interactive visualization of protein dynamics | 10.1109/VISUAL.2000.885733 | The study of time dependent characteristics of proteins is important for gaining insight into many biological processes. However, visualizing protein dynamics by animating atom trajectories does not provide satisfactory results. When the trajectory is sampled with large times steps, the impression of smooth motion will be destroyed due to the effects of temporal aliasing. Sampling with small time steps will result in the camouflage of interesting motions. In this case study, we discuss techniques for the interactive 3D visualization of the dynamics of the photoactive yellow protein. We use essential dynamics methods to filter out uninteresting atom motions from the larger concerted motions. In this way, clear and concise 3D animations of protein motions can be produced. In addition, we discuss various interactive techniques that allow exploration of the essential subspace of the protein. We discuss the merits of these techniques when applied to the analysis of the yellow protein. | false | false | [
"Henk Huitema",
"Robert van Liere"
] | [] | [] | [] |
Vis | 2,000 | Interior/exterior classification of polygonal models | 10.1109/VISUAL.2000.885723 | We present an algorithm for automatically classifying the interior and exterior parts of a polygonal model. The need for visualizing the interiors of objects frequently arises in medical visualization and CAD modeling. The goal of such visualizations is to display the model in a way that the human observer can easily understand the relationship between the different parts of the surface. While there exist excellent methods for visualizing surfaces that are inside one another (nested surfaces), the determination of which parts of the surface are interior is currently done manually. Our automatic method for interior classification takes a sampling approach using a collection of direction vectors. Polygons are said to be interior to the model if they are not visible in any of these viewing directions from a point outside the model. Once we have identified polygons as being inside or outside the model, these can be textured or have different opacities applied to them so that the whole model can be rendered in a more comprehensible manner. An additional consideration for some models is that they may have holes or tunnels running through them that are connected to the exterior surface. Although an external observer can see into these holes, it is often desirable to mark the walls of such tunnels as being part of the interior of a model. In order to allow this modified classification of the interior, we use morphological operators to close all the holes of the model. An input model is used together with its closed version to provide a better classification of the portions of the original model. | false | false | [
"Fakir S. Nooruddin",
"Greg Turk"
] | [] | [] | [] |
Vis | 2,000 | Isosurfacing in higher dimensions | 10.1109/VISUAL.2000.885704 | Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions higher than three. Most algorithms require a sampling in three-dimensions before applying any visualization algorithms. This sampling typically ignores vital features that may be present when examined in oblique cross-sections, and places an undo burden on system resources when animation through additional dimensions is desired. For time-varying data of large data sets, smooth animation is desired at interactive rates. We provide a fast Marching Cubes like algorithm for hypercubes of any dimension. To support this, we have developed a new algorithm to automatically generate the isosurface and triangulation tables for any dimension. This allows the efficient calculation of 4D isosurfaces, which can be interactively sliced to provide smooth animation or slicing through oblique hyperplanes. The former allows for smooth animation in a very compressed format. The latter provide better tools to study time-evolving features as they move downstream. We also provide examples in using this technique to show interval volumes or the sensitivity of a particular isovalue threshold. | false | false | [
"Praveen Bhaniramka",
"Rephael Wenger",
"Roger Crawfis"
] | [] | [] | [] |
Vis | 2,000 | Mastering interactive surface rendering for Java-based diagnostic applications | 10.1109/VISUAL.2000.885726 | The display of iso-surfaces in medical data sets is an important visualization technique used by radiologists for the diagnosis of volumetric density data sets. The demands put by radiologists on such a display technique are interactivity, multiple stacked transparent surfaces and cutting planes that allow an interactive clipping of the surfaces. This paper presents a Java based, platform independent implementation of a very fast surface rendering algorithm which combines the advantages of explicit surface representation, splatting, and shear-warp projection to fulfill all these requirements. The algorithm is implemented within the context of J-Vision, an application for viewing and diagnosing medical images which is currently in use at various hospitals. | false | false | [
"Lukas Mroz",
"Rainer Wegenkittl",
"M. Eduard Gröller"
] | [] | [] | [] |
Vis | 2,000 | Mastering interactive virtual bronchioscopy on a low-end PC | 10.1109/VISUAL.2000.885732 | Virtual endoscopy presents the cross-sectional acquired 3D-data of a computer tomograph as an endoluminal view. The common approach for the visualization of a virtual endoscopy is surface rendering, yielding images close to a real endoscopy. If external structures are of interest, volume rendering techniques have to be used. These methods do not display the exact shape of the inner lumen very well. For certain applications, e.g. operation planning of a transbronchial biopsy, both the shape of the inner lumen as well as outer structures like blood vessels and the tumor have to be delineated. A method is described, that allows a quick and easy hybrid visualization using overlays of different visualization methods like different surfaces or volume renderings with different transfer functions in real time on a low-end PC. To achieve real time frame rates, image based rendering techniques have been used. | false | false | [
"Rainer Wegenkittl",
"Anna Vilanova",
"Balint Hegedüs",
"Daniel Wagner",
"Martin C. Freund",
"M. Eduard Gröller"
] | [] | [] | [] |
Vis | 2,000 | Multi-resolution dynamic meshes with arbitrary deformations | 10.1109/VISUAL.2000.885724 | Multi-resolution techniques and models have been shown to be effective for the display and transmission of large static geometric object. Dynamic environments with internally deforming models and scientific simulations using dynamic meshes pose greater challenges in terms of time and space, and need the development of similar solutions. We introduce the T-DAG, an adaptive multi-resolution representation for dynamic meshes with arbitrary deformations including attribute, position, connectivity and topology changes. T-DAG stands for time-dependent directed acyclic graph which defines the structure supporting this representation. We also provide an incremental algorithm (in time) for constructing the T-DAG representation of a given input mesh. This enables the traversal and use of the multi-resolution dynamic model for partial playback while still constructing new time-steps. | false | false | [
"Ariel Shamir",
"Chandrajit L. Bajaj",
"Valerio Pascucci"
] | [] | [] | [] |
Vis | 2,000 | Multi-resolution visualization techniques for nested weather models | 10.1109/VISUAL.2000.885745 | Scaling of simulations challenges the effectiveness of conventional visualization methods. This problem becomes two-fold for mesoscale weather models that operate in near-real-time at cloud-scale resolution. For example, typical approaches to vector field visualization (e.g., wind) are based upon global methods, which may not illustrate detailed structure. In addition, such computations employ multi-resolution meshes to capture small-scale phenomena, which are not properly reflected in both vector and scalar realizations. To address the former critical point analysis and simple bandpass filtering of wind fields is employed for better seed point identification of streamline calculations. For the latter, an encapsulation of nested computational meshes is developed for general realization. It is then combined with the seed point calculation for an improved vector visualization of multi-resolution weather forecasting data. | false | false | [
"Lloyd Treinish"
] | [] | [] | [] |
Vis | 2,000 | multi-user view-dependent rendering | 10.1109/VISUAL.2000.885713 | We present a novel architecture which allows rendering of a large-shared dataset at interactive rates on an inexpensive workstation. The idea is based on view-dependent rendering on a client-server network. The server stores the large dataset and manages the selection of the various levels of detail while the inexpensive clients receive a stream of update operations that generate the appropriate level of detail in an incremental fashion. These update operations are based on changes in the clients' view-parameters. Our approach dramatically reduces the amount of memory needed by each client and the entire computing system since the dataset is stored only once on the server's local memory. In addition, it decreases the load on the network as results of the incremental update contributed by view-dependent rendering. | false | false | [
"Jihad El-Sana"
] | [] | [] | [] |
Vis | 2,000 | Navigating high-dimensional spaces to support design steering | 10.1109/VISUAL.2000.885707 | Throughout the design cycle, visualization, whether a sketch scribbled on the back of a spare piece of paper or a fully detailed drawing, has been the mainstay of design: we need to see the product. One of the most important stages of the design cycle is the initial, or concept, stage and it is here that design variants occur in large numbers to be vetted quickly. At this initial stage the human element, the designer is crucial to the success of the product. We describe an interactive environment for concept design which recognises the needs of the designer, not only to see the product and make rapid modifications, but also to monitor the progress of their design towards some preferred solution. This leads to the notion of a design parameter space, typically high-dimensional, which must also be visualized in addition to the product itself. Using a module developed for IRIS Explorer design steering is presented as a navigation of this space in order to search for optimal designs, either manually or by local optimisation. | false | false | [
"Helen Wright",
"Ken Brodlie",
"Tim David"
] | [] | [] | [] |
Vis | 2,000 | New techniques for topologically correct surface reconstruction | 10.1109/VISUAL.2000.885718 | We present a novel approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that, we introduce the concept of /spl lambda/-intervals. It turns out that for smooth regions of the surface this method works very well and at difficult parts of the surface yields an output well-suited for postprocessing. As a postprocessing step we propose a topological clean up and a new technique based on linear programming in order to establish a topologically correct surface. These techniques should be useful also for many other reconstruction schemes. | false | false | [
"Udo Adamy",
"Joachim Giesen",
"Matthias John 0003"
] | [] | [] | [] |
Vis | 2,000 | On-the-fly rendering of losslessly compressed irregular volume data | 10.1109/VISUAL.2000.885682 | Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to alleviate the disk I/O overhead associated with rendering a large tetrahedral mesh is to reduce the I/O bandwidth requirement through compression. Existing tetrahedral mesh compression algorithms focus only on compression efficiency and cannot be readily integrated into the mesh rendering process, and thus demand that a compressed tetrahedral mesh be decompressed before it can be rendered into a 2D image. This paper presents an integrated tetrahedral mesh compression and rendering algorithm called Gatun, which allows compressed tetrahedral meshes to be rendered incrementally as they are being decompressed, thus leading to an efficient irregular grid rendering pipeline. Both compression and rendering algorithms in Gatun exploit the same local connectivity information among adjacent tetrahedra, and thus can be tightly integrated into a unified implementation framework. Our tetrahedral compression algorithm is specifically designed to facilitate the integration with an irregular grid renderer without any compromise in compression efficiency. A unique performance advantage of Gatun is its ability to reduce the runtime memory footprint requirement by releasing memory allocated to tetrahedra as early as possible. | false | false | [
"Chuan-Kai Yang",
"Tulika Mitra",
"Tzi-cker Chiueh"
] | [] | [] | [] |
Vis | 2,000 | Pen-and-ink rendering in volume visualisation | 10.1109/VISUAL.2000.885696 | Concerns the development of non-photorealistic rendering techniques for volume visualisation. In particular, we present two pen-and-ink rendering methods, a 3D method based on non-photorealistic solid textures, and a 2/sup +/D method that involves two rendering phases in the object space and the image space respectively. As both techniques utilize volume- and image-based data representations, they can be built upon a traditional volume rendering pipeline, and can be integrated with the photorealistic methods available in such a pipeline. We demonstrate that such an integration facilitates an effective mechanism for enhancing visualisation and its interpretation. | false | false | [
"Steve M. F. Treavett",
"Min Chen 0001"
] | [] | [] | [] |
Vis | 2,000 | Polyhedral modeling | 10.1109/VISUAL.2000.885719 | Polyhedral meshes are used for visualization, computer graphics or geometric modeling purposes and result from many applications like iso-surface extraction, surface reconstruction or CAD/CAM. The paper introduces a method for constructing smooth surfaces from a triangulated polyhedral mesh of arbitrary topology. It presents a new algorithm which generalizes and improves the triangle 4-split method (S. Hahmann and G.-P. Bonneau) in the crucial point of boundary curve network construction. This network is then filled in by a visual smooth surface from which an explicit closed form parametrization is given. Furthermore, the method becomes now completely local and can interpolate normal vector input at the mesh vertices. | false | false | [
"Georges-Pierre Bonneau",
"Stefanie Hahmann"
] | [] | [] | [] |
Vis | 2,000 | Procedural annotation of uncertain information | 10.1109/VISUAL.2000.885679 | In many applications of scientific visualization, a large quantity of data is being processed and displayed in order to enable a viewer to make informed and effective decisions. Since little data is perfect, there is almost always some degree of associated uncertainty. This uncertainty is an important part of the data and should be taken into consideration when interpreting the data. Uncertainty, however, should not overshadow the data values. Many methods that address the problem of visualizing data with uncertainty can distort the data and emphasize areas with uncertain values. We have developed a method for showing the uncertainty information together with data with minimal distraction. This method uses procedurally generated annotations which are deformed according to the uncertainty information. As another possible technique we propose distorting glyphs according to the uncertainty information. | false | false | [
"Andrej Cedilnik",
"Penny Rheingans"
] | [] | [] | [] |
Vis | 2,000 | Real-time visualization of the clear-up of a former US naval base | 10.1109/VISUAL.2000.885743 | The paper describes the effective real-time visualization of the clear-up operation of a former US nuclear submarine base, located in Holy Loch, Scotland. The Whole Field Modelling System has provided an extremely accurate real-time visualization of a large number of varying parameters such as remotely operated vehicles, cranes, barges, grabs, magnets, and detailed seabed topography. The system has improved the field staffs' spatial and temporal awareness of the underwater environment and facilitated decision-making within the complex offshore working environment. | false | false | [
"Paul Chapman",
"Derek Wills",
"Peter Stevens",
"Graham R. Brookes"
] | [] | [] | [] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.