TC: Node Trajectory Compressor
TC: Node Trajectory Compressor TC is a set of compression algorithms designed for lossy compression of time varying node positional
Continue readingAssociate Professor, University of Utah
TC: Node Trajectory Compressor TC is a set of compression algorithms designed for lossy compression of time varying node positional
Continue readingA multiscale approach to network event identification using geolocated twitter data Chao Yang, Ian Jensen, and Paul Rosen In Proceedings of
Continue readingMalfatti’s problem, first published in 1803, is commonly understood to ask fitting three circles into a given triangle tangent to each other and to a pair of the triangle’s sides. We consider a generalization of the problem that fits six circles into the triangle.
Continue readingIn this paper, the problem of packing circles into a domain of prescribed topology is considered.
Continue readingWe introduce several useful utilities in development for the creation and analysis of real wildland fire simulations using WRF and SFIRE. These utilities exist as standalone programs and scripts as well as extensions to other well known software.
Continue readingIn this paper, we first identify frequently occurring types of uncertainty. Second, we connect those uncertainty representations to ones commonly used in visualization.We then look at various approaches to visualizing this uncertainty by partitioning the work based on the dimensionality of the data and the dimensionality of the uncertainty, and we discuss noteworthy exceptions to our taxonomy along with future research directions for the uncertainty visualization community.
Continue readingWe propose to aid the interactive visualization of time-varying spatial datasets by simplifying node position data over the entire simulation as opposed to over individual states. Our approach is based on two observations. The first observation is that the trajectory of some nodes can be approximated well without recording the position of the node for every state. The second observation is that there are groups of nodes whose motion from one state to the next can be approximated well with a single transformation. We present dataset simplification techniques that take advantage of this node data redundancy.
Continue readingRTW is an efficient method for adaptively sampling a shadow map using a set of user/developer-defined heuristics. RTW is both memory and computationally efficient, delivering exceedingly high-quality results in real-time.
Continue readingWe demonstrate the application of topological analysis techniques to the rather unexpected domain of software visualization. We use topological persistence to automatically detect significant circular structures in the point cloud, which represent recurrent or cyclical runtime program behaviors.
Continue readingIn this work, we present our experiences in disseminating the results of two studies to national audience. The resulting visualizations and press releases allowed the studies’ researchers to educate a national, if not global, audience.
Continue reading