John C. Hart
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
John C. Hart has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Mingcheng Chen
University of Illinois at Urbana-Champaign
2 shared publications- Jared Hoberock
University of Illinois Urbana‐Champaign, USA
1 shared publication - Michael Garland
NVIDIA Research, USA
1 shared publication - Nathan Carr
Adobe Research, San Jose, USA
1 shared publication Shawn C. Shadden
University of California
1 shared publication- Shawn C. Shadden
Department of Mechanical Engineering, University of California, Berkeley, CA, USA
1 shared publication
Latest Publications
- 3 June 2017
- Published by Springer Nature
- p. 237-251
Hierarchical Watershed Ridges for Visualizing Lagrangian Coherent Structures
- 3 June 2017
- Published by Springer Nature
- p. 237-251
Hierarchical Watershed Ridges for Visualizing Lagrangian Coherent Structures
- Open Access
- 4 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 22 (8) , 1960-1973
Fast Coherent Particle Advection through Time-Varying Unstructured Flow Datasets
Tracing the paths of collections of particles through a flow field is a key step for many flow visualization and analysis methods. When a flow field is interpolated from the nodes of an unstructured mesh, the process of advecting a particle must first find which cell in the unstructured mesh contains the particle. Since the paths of nearby particles often diverge, the parallelization of particle advection quickly leads to incoherent memory accesses of the unstructured mesh. We have developed a new block advection GPU approach that reorganizes particles into spatially coherent bundles as they follow their advection paths, which greatly improves memory coherence and thus shared-memory GPU performance. This approach works best for flows that meet the CFL criterion on unstructured meshes of uniformly sized elements, small enough to fit at least two timesteps in GPU memory.
- 4 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 22 (8) , 1960-1973
Open AccessFast Coherent Particle Advection through Time-Varying Unstructured Flow Datasets
Tracing the paths of collections of particles through a flow field is a key step for many flow visualization and analysis methods. When a flow field is interpolated from the nodes of an unstructured mesh, the process of advecting a particle must first find which cell in the unstructured mesh contains the particle. Since the paths of nearby particles often diverge, the parallelization of particle advection quickly leads to incoherent memory accesses of the unstructured mesh. We have developed a new block advection GPU approach that reorganizes particles into spatially coherent bundles as they follow their advection paths, which greatly improves memory coherence and thus shared-memory GPU performance. This approach works best for flows that meet the CFL criterion on unstructured meshes of uniformly sized elements, small enough to fit at least two timesteps in GPU memory.
- 20 September 2011
- Published by Wiley in Computer Graphics Forum
- Vol. 30 (8) , 2314-2327
Social Network Clustering and Visualization using Hierarchical Edge Bundles
The hierarchical edge bundle (HEB) method generates useful visualizations of dense graphs, such as social networks, but requires a predefined clustering hierarchy, and does not easily benefit from existing straight‐line visualization improvements. This paper proposes a new clustering approach that extracts the community structure of a network and organizes it into a hierarchy that is flatter than existing community‐based clustering approaches and maps better to HEB visualization. Our method not only discovers communities and generates clusters with better modularization qualities, but also creates a balanced hierarchy that allows HEB visualization of unstructured social networks without predefined hierarchies. Results on several data sets demonstrate that this approach clarifies real‐world communication, collaboration and competition network structure and reveals information missed in previous visualizations. We further implemented our techniques into a social network visualization application on facebook.com and let users explore the visualization and community clustering of their own social networks.
- 20 September 2011
- Published by Wiley in Computer Graphics Forum
- Vol. 30 (8) , 2314-2327
Social Network Clustering and Visualization using Hierarchical Edge Bundles
The hierarchical edge bundle (HEB) method generates useful visualizations of dense graphs, such as social networks, but requires a predefined clustering hierarchy, and does not easily benefit from existing straight‐line visualization improvements. This paper proposes a new clustering approach that extracts the community structure of a network and organizes it into a hierarchy that is flatter than existing community‐based clustering approaches and maps better to HEB visualization. Our method not only discovers communities and generates clusters with better modularization qualities, but also creates a balanced hierarchy that allows HEB visualization of unstructured social networks without predefined hierarchies. Results on several data sets demonstrate that this approach clarifies real‐world communication, collaboration and competition network structure and reveals information missed in previous visualizations. We further implemented our techniques into a social network visualization application on facebook.com and let users explore the visualization and community clustering of their own social networks.
- 14 September 2010
- Published by Wiley in Computer Graphics Forum
- Vol. 29 (6) , 1993-2003
Arbitrary Importance Functions for Metropolis Light Transport
- 14 September 2010
- Published by Wiley in Computer Graphics Forum
- Vol. 29 (6) , 1993-2003
Arbitrary Importance Functions for Metropolis Light Transport
- Open Access
- 8 July 2004
- Published by Association for Computing Machinery (ACM)
- p. 224-234
Two algorithms for fast reclustering of dynamic meshed surfaces
- 8 July 2004
- Published by Association for Computing Machinery (ACM)
- p. 224-234
Open AccessTwo algorithms for fast reclustering of dynamic meshed surfaces
- 1 January 1999
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 36-43
Computational topology for shape modeling
Expands the role of the new field of computational topology by surveying methods for incorporating connectedness in shape modeling. Two geometric representations in particular-recurrent models and implicit surfaces-can (often unpredictably) become connected or disconnected based on typical changes in modeling parameters. Two methodologies for controlling connectedness are identified: connectedness loci and Morse theory. The survey concludes by identifying several open problems remaining in shape modeling for computational topology to solve.
- 1 January 1999
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 36-43
Computational topology for shape modeling
Expands the role of the new field of computational topology by surveying methods for incorporating connectedness in shape modeling. Two geometric representations in particular-recurrent models and implicit surfaces-can (often unpredictably) become connected or disconnected based on typical changes in modeling parameters. Two methodologies for controlling connectedness are identified: connectedness loci and Morse theory. The survey concludes by identifying several open problems remaining in shape modeling for computational topology to solve.