Kathleen S. Bonnell

dblp:87/2534 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 67% Visualization and visual analytics · 33%
Theoretical computer science
1 paper
Computational geometry · 50% Coding theory · 50%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › 3d reconstruction
material interface reconstruction
0.012003
Material Interface Reconstruction · IEEE Trans. Vis. Comput. Graph. 2003
Visualization and visual analytics
scientific visualization
0.012003
Material Interface Reconstruction · IEEE Trans. Vis. Comput. Graph. 2003
Computational geometry
voronoi diagram
0.012003
Material Interface Reconstruction · IEEE Trans. Vis. Comput. Graph. 2003
Coding theory › lattice codes
voronoi region
0.012003
Material Interface Reconstruction · IEEE Trans. Vis. Comput. Graph. 2003

Methods — techniques the papers use, named apart from their topics

triangulation · 0.1barycentric coordinates · 0.1
YearPublicationVenuePosition
2005 A Contract Based System For Large Data Visualization
abstract
VisIt is a richly featured visualization tool that is used to visualize some of the largest simulations ever run. The scale of these simulations requires that optimizations are incorporated into every operation VisIt performs. But the set of applicable optimizations that VisIt can perform is dependent on the types of operations being done. Complicating the issue, VisIt has a plugin capability that allows new, unforeseen components to be added, making it even harder to determine which optimizations can be applied. We introduce the concept of a contract to the standard data flow network design. This contract enables each component of the data flow network to modify the set of optimizations used. In addition, the contract allows for new components to be accommodated gracefully within VisIt's data flow network system.
Hank Childs, Eric Brugger, Kathleen S. Bonnell, Jeremy S. Meredith, Mark C. Miller, Brad Whitlock, Nelson L. Max
IEEE Visualization3
2003 Material Interface Reconstruction
abstract
The paper presents an algorithm for material interface reconstruction for data sets where fractional material information is given as a percentage for each element of the underlying grid. The reconstruction problem is transformed to a problem that analyzes a dual grid, where each vertex in the dual grid has an associated barycentric coordinate tuple that represents the fraction of each material present. Material boundaries are constructed by analyzing the barycentric coordinate tuples of a tetrahedron in material space and calculating intersections with Voronoi cells that represent the regions where one material dominates. These intersections are used to calculate intersections in the Euclidean coordinates of the tetrahedron. By triangulating these intersection points, one creates the material boundary. The algorithm can treat data sets containing any number of materials. The algorithm can also create nonmanifold boundary surfaces if necessary. By clipping the generated material boundaries against the original cells, one can examine the error in the algorithm. Error analysis shows that the algorithm preserves volume fractions within an error range of 0.5 percent per material.
Kathleen S. Bonnell, Mark A. Duchaineau, Daniel Schikore, Bernd Hamann, Kenneth I. Joy
IEEE Trans. Vis. Comput. Graph.1
2000 Constructing material interfaces from data sets with volume-fraction information
abstract
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.
Kathleen S. Bonnell, Kenneth I. Joy, Bernd Hamann, Daniel Schikore, Mark A. Duchaineau
IEEE Visualization1