Search For:

Displaying 1-9 out of 9 total
Efficient data restructuring and aggregation for I/O acceleration in PIDX
Found in: 2012 SC - International Conference for High Performance Computing, Networking, Storage and Analysis
By Sidharth Kumar,Venkatram Vishwanath,Philip Carns,Joshua A. Levine,Robert Latham,Giorgio Scorzelli,Hemanth Kolla,Ray Grout,Robert Ross,Michael E. Papka,Jacqueline Chen,Valerio Pascucci
Issue Date:November 2012
pp. 1-11
Hierarchical, multiresolution data representations enable interactive analysis and visualization of large-scale simulations. One promising application of these techniques is to store high performance computing simulation output in a hierarchical Z (HZ) ord...
A Delaunay Simplification Algorithm for Vector Fields
Found in: Computer Graphics and Applications, Pacific Conference on
By Tamal K. Dey, Joshua A. Levine, Rephael Wenger
Issue Date:November 2007
pp. 281-290
We present a Delaunay based algorithm for simplifying vector field datasets. Our aim is to reduce the size of the mesh on which the vector field is defined while preserving topological features of the original vector field. We leverage a simple paradigm, v...
Delaunay Meshing of Isosurfaces
Found in: Shape Modeling and Applications, International Conference on
By Tamal K. Dey, Joshua A. Levine
Issue Date:June 2007
pp. 241-250
We present an isosurface meshing algorithm, DELISO, based on the Delaunay refinement paradigm. This paradigm has been successfully applied to mesh a variety of domains with guarantees for topology, geometry, mesh gradedness, and triangle shape. A restricte...
Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees
Found in: IEEE Transactions on Visualization and Computer Graphics
By Jonathan Bronson,Joshua A. Levine,Ross Whitaker
Issue Date:February 2014
pp. 223-237
We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral me...
Mapping applications with collectives over sub-communicators on torus networks
Found in: 2012 SC - International Conference for High Performance Computing, Networking, Storage and Analysis
By Abhinav Bhatele,Todd Gamblin,Steven H. Langer,Peer-Timo Bremer,Erik W. Draeger,Bernd Hamann,Katherine E. Isaacs,Aaditya G. Landge,Joshua A. Levine,Valerio Pascucci,Martin Schulz,Charles H. Still
Issue Date:November 2012
pp. 1-11
The placement of tasks in a parallel application on specific nodes of a supercomputer can significantly impact performance. Traditionally, this task mapping has focused on reducing the distance between communicating tasks on the physical network. This mini...
Edge maps: Representing flow with bounded error
Found in: 2011 IEEE Pacific Visualization Symposium (PacificVis)
By Harsh Bhatia,Shreeraj Jadhav,Peer-Timo Bremer, Guoning Chen,Joshua A Levine,Luis Gustavo Nonato,Valerio Pascucci
Issue Date:March 2011
pp. 75-82
Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Many analysis techniques rely on computing streamlines, a task often hampered by numerical instabilities. Approach...
A benchmark for surface reconstruction
Found in: ACM Transactions on Graphics (TOG)
By Claudio T. Silva, Gabriel Taubin, Joshua A. Levine, Luis Gustavo Nonato, Matthew Berger
Issue Date:April 2013
pp. 1-17
We present a benchmark for the evaluation and comparison of algorithms which reconstruct a surface from point cloud data. Although a substantial amount of effort has been dedicated to the problem of surface reconstruction, a comprehensive means of evaluati...
Repairing and meshing imperfect shapes with Delaunay refinement
Found in: 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling (SPM '09)
By Joshua A. Levine, Oleksiy Busaryev, Tamal K. Dey
Issue Date:October 2009
pp. 25-33
As a direct consequence of software quirks, designer errors, and representation flaws, often three-dimensional shapes are stored in formats that introduce inconsistencies such as small gaps and overlaps between surface patches. We present a new algorithm t...
Delpsc: a delaunay mesher for piecewise smooth complexes
Found in: Proceedings of the twenty-fourth annual symposium on Computational geometry (SCG '08)
By Joshua A. Levine, Tamal K. Dey
Issue Date:June 2008
pp. 305-305
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth complexes admit a large class of geometric domains including polyhedra, smooth an...