This Special Session lightning round features 12 dynamic trailblazers from SIGGRAPH history who are continually empowered by innovation into present day explorations. These women interweave stories across time that tr...
详细信息
ISBN:
(纸本)9781450363129
This Special Session lightning round features 12 dynamic trailblazers from SIGGRAPH history who are continually empowered by innovation into present day explorations. These women interweave stories across time that transformed digital media and shaped SIGGRAPH; while at the same time these women personally benefited from the interdisciplinary graphics community.
Particle based model simulations are widely used in scientificvisualization. In cosmology, particles are used to simulate the evolution of dark matter in the universe. Clusters of particles (that have special statist...
详细信息
Particle based model simulations are widely used in scientificvisualization. In cosmology, particles are used to simulate the evolution of dark matter in the universe. Clusters of particles (that have special statistical properties) are called halos. From a visualization point of view, halos are clusters of particles, each having a position, mass and velocity in three dimensional space, and they can be represented as point clouds that contain various structures of geometric interest such as filaments, membranes, satellite of points, clusters, and cluster of clusters. The thesis investigates methods for interacting with large scale data-sets represented as point clouds. The work mostly aims at the interactive visualization of cosmological simulation based on large particle systems. The study consists of three components: a) two human factors experiments into the perceptual factors that make it possible to see features in point clouds; b) the design and implementation of a user interface making it possible to rapidly navigate through and visualize features in the point cloud, c) software development and integration to support visualization.
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structure...
详细信息
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial complexes, and we define an efficient encoding for the discrete Morse gradient on the most compact of such representations. We theoretically compare methods based on reductions and coreductions for computing a discrete Morse gradient, proving that the combination of reductions and coreductions produces new mutually equivalent approaches. We design and implement a new algorithm for computing a discrete Morse complex on simplicial complexes. We show that our approach scales very well with the size and the dimension of the simplicial complex also through comparisons with the only existing public-domain algorithm for discrete Morse complex computation. We discuss applications to the computation of multi-parameter persistent homology and of extremum graphs for visualization of time-varying 3D scalar fields.
暂无评论