Search For:

Displaying 1-26 out of 26 total
Detecting Symmetry in Scalar Fields Using Augmented Extremum Graphs
Found in: IEEE Transactions on Visualization and Computer Graphics
By Dilip Mathew Thomas,Vijay Natarajan
Issue Date:December 2013
pp. 2663-2672
Visualizing symmetric patterns in the data often helps the domain scientists make important observations and gain insights about the underlying experiment. Detecting symmetry in scalar fields is a nascent area of research and existing methods that detect s...
 
An Exploration Framework to Identify and Track Movement of Cloud Systems
Found in: IEEE Transactions on Visualization and Computer Graphics
By Harish Doraiswamy,Vijay Natarajan,Ravi S. Nanjundiah
Issue Date:December 2013
pp. 2896-2905
We describe a framework to explore and visualize the movement of cloud systems. Using techniques from computational topology and computer vision, our framework allows the user to study this movement at various scales in space and time. Such movements could...
 
Symmetry in Scalar Field Topology
Found in: IEEE Transactions on Visualization and Computer Graphics
By Dilip Mathew Thomas,Vijay Natarajan
Issue Date:December 2011
pp. 2035-2044
Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape proc...
 
Local and Global Comparison of Continuous Functions
Found in: Visualization Conference, IEEE
By Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
Issue Date:October 2004
pp. 275-280
We introduce local and global comparison measures for a collection of k ≤ d real-valued smooth functions on a common d-dimensional Riemannian manifold. For k = d = 2 we relate the measures to the set of critical points of one function restricted to the lev...
 
Simplification of Three-Dimensional Density Maps
Found in: IEEE Transactions on Visualization and Computer Graphics
By Vijay Natarajan, Herbert Edelsbrunner
Issue Date:September 2004
pp. 587-597
We consider scientific data sets that describe density functions over three-dimensional geometric domains. Such data sets are often large and coarsened representations are needed for visualization and analysis. Assuming a tetrahedral mesh representation, w...
 
Parallel Algorithms for Hamiltonian 2 -Separator Chordal Graphs
Found in: Parallel and Distributed Processing Symposium, International
By B.S. Panda, Vijay Natarajan
Issue Date:April 2001
pp. 10035a
In this paper we propose a parallel algorithm to construct a one-sided monotone polygon from a Hamiltonian 2-sep chordal graph which takes O(log n) time and uses O(n) processors on a CREW PRAM model. We also propose parallel algorithms to recognize Hamilto...
 
A Diffusion-Based Processor Reallocation Strategy for Tracking Multiple Dynamically Varying Weather Phenomena
Found in: 2013 42nd International Conference on Parallel Processing (ICPP)
By Preeti Malakar,Vijay Natarajan,Sathish S. Vadhiyar,Ravi S. Nanjundiah
Issue Date:October 2013
pp. 50-59
Many meteorological phenomena occur at different locations simultaneously. These phenomena vary temporally and spatially. It is essential to track these multiple phenomena for accurate weather prediction. Efficient analysis require high-resolution simulati...
 
A divide and conquer strategy for scaling weather simulations with multiple regions of interest
Found in: 2012 SC - International Conference for High Performance Computing, Networking, Storage and Analysis
By Preeti Malakar,Thomas George,Sameer Kumar,Rashmi Mittal,Vijay Natarajan,Yogish Sabharwal,Vaibhav Saxena,Sathish S. Vadhiyar
Issue Date:November 2012
pp. 1-11
Accurate and timely prediction of weather phenomena, such as hurricanes and flash floods, require high-fidelity compute intensive simulations of multiple finer regions of interest within a coarse simulation domain. Current weather applications execute thes...
 
Parallel Computation of 2D Morse-Smale Complexes
Found in: IEEE Transactions on Visualization and Computer Graphics
By Nithin Shivashankar,Senthilnathan M,Vijay Natarajan
Issue Date:October 2012
pp. 1757-1770
The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh elements of the domain in parallel to compute the Morse-Smale complex of large 2D da...
 
Integrated Parallelization of Computations and Visualization for Large-scale Applications
Found in: 2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
By Preeti Malakar,Vijay Natarajan,Sathish S. Vadhiyar
Issue Date:May 2012
pp. 2510-2513
Critical applications like cyclone tracking and earthquake modeling require simultaneous high-performance simulations and online visualization for timely analysis. Faster simulations and simultaneous visualization enable scientists provide real-time guidan...
 
Errata to
Found in: IEEE Transactions on Visualization and Computer Graphics
By Suthambhara Nagaraj,Vijay Natarajan
Issue Date:May 2011
pp. 709-710
No summary available.
 
Output-Sensitive Construction of Reeb Graphs
Found in: IEEE Transactions on Visualization and Computer Graphics
By Harish Doraiswamy,Vijay Natarajan
Issue Date:January 2012
pp. 146-159
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any d...
 
Link Conditions for Simplifying Meshes with Embedded Structures
Found in: IEEE Transactions on Visualization and Computer Graphics
By Dilip Mathew Thomas, Vijay Natarajan, Georges-Pierre Bonneau
Issue Date:July 2011
pp. 1007-1019
Interactive visualization applications benefit from simplification techniques that generate good-quality coarse meshes from high-resolution meshes that represent the domain. These meshes often contain interesting substructures, called embedded structures, ...
 
Relation-Aware Isosurface Extraction in Multifield Data
Found in: IEEE Transactions on Visualization and Computer Graphics
By Suthambhara Nagaraj, Vijay Natarajan
Issue Date:February 2011
pp. 182-191
We introduce a variation density function that profiles the relationship between multiple scalar fields over isosurfaces of a given scalar field. This profile serves as a valuable tool for multifield data exploration because it provides the user with cues ...
 
A Topological Approach to Simplification of Three-Dimensional Scalar Functions
Found in: IEEE Transactions on Visualization and Computer Graphics
By Attila Gyulassy, Vijay Natarajan, Valerio Pascucci, Peer-Timo Bremer, Bernd Hamann
Issue Date:July 2006
pp. 474-484
<p><b>Abstract</b>—This paper describes an efficient combinatorial method for simplification of topological features in a 3D scalar function. The Morse-Smale complex, which provides a succinct representation of a function's associated gra...
 
Segmenting Point Sets
Found in: Shape Modeling and Applications, International Conference on
By Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, Bernd Hamann
Issue Date:June 2006
pp. 6
Extracting features from point sets is becoming increasingly important for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sampled surface into distinct features without explicit construction o...
 
Topology-based Simplification for Feature Extraction from 3D Scalar Fields
Found in: Visualization Conference, IEEE
By Attila Gyulassy, Vijay Natarajan, Valerio Pascucci, Peer-Timo Bremer, Bernd Hamann
Issue Date:October 2005
pp. 68
In this paper, we present a topological approach for simplifying continuous functions defined on volumetric domains. We introduce two atomic operations that remove pairs of critical points of the function and design a combinatorial algorithm that simplifie...
 
An Adaptive Framework for Simulation and Online Remote Visualization of Critical Climate Applications in Resource-constrained Environments
Found in: SC Conference
By Preeti Malakar, Vijay Natarajan, Sathish S. Vadhiyar
Issue Date:November 2010
pp. 1-11
Critical climate applications like cyclone tracking and earthquake modeling require high-performance simulations and online visualization simultaneously performed with the simulations for timely analysis. Remote visualization of critical climate events ena...
 
Multiscale Symmetry Detection in Scalar Fields by Clustering Contours
Found in: IEEE Transactions on Visualization and Computer Graphics
By Dilip Thomas,Vijay Natarajan
Issue Date:February 2015
pp. 1
The complexity in visualizing volumetric data often limits the scope of direct exploration of scalar fields. Isocontour extraction is a popular method for exploring scalar fields because of its simplicity in presenting features in the data. In this paper, ...
 
Detecting Symmetry in Scalar Fields Using Augmented Extremum Graphs
Found in: IEEE Transactions on Visualization and Computer Graphics
By Dilip Mathew Thomas,Vijay Natarajan
Issue Date:December 2013
pp. 2663-2672
Visualizing symmetric patterns in the data often helps the domain scientists make important observations and gain insights about the underlying experiment. Detecting symmetry in scalar fields is a nascent area of research and existing methods that detect s...
 
An Exploration Framework to Identify and Track Movement of Cloud Systems
Found in: IEEE Transactions on Visualization and Computer Graphics
By Harish Doraiswamy,Vijay Natarajan,Ravi S. Nanjundiah
Issue Date:December 2013
pp. 2896-2905
We describe a framework to explore and visualize the movement of cloud systems. Using techniques from computational topology and computer vision, our framework allows the user to study this movement at various scales in space and time. Such movements could...
 
A hybrid parallel algorithm for computing and tracking level set topology
Found in: 2012 19th International Conference on High Performance Computing (HiPC)
By Senthilnathan Maadasamy,Harish Doraiswamy,Vijay Natarajan
Issue Date:December 2012
pp. 1-10
The contour tree is a topological abstraction of a scalar field that captures evolution in level set connectivity. It is an effective representation for visual exploration and analysis of scientific data. We describe a work-efficient, output sensitive, and...
   
Topologically Clean Distance Fields
Found in: IEEE Transactions on Visualization and Computer Graphics
By A.G. Gyulassy,M.A. Duchaineau, Vijay Natarajan,V. Pascucci,E.M. Bringa,A. Higginbotham,B. Hamann
Issue Date:November 2007
pp. 1432-1439
Analysis of the results obtained from material simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated porous solid as it is hit by a projectile. This paper describes two techni...
 
Improved quadric surface impostors for large bio-molecular visualization
Found in: Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing (ICVGIP '12)
By Nithin Shivashankar, Pranav D. Bagur, Vijay Natarajan
Issue Date:December 2012
pp. 1-8
The shape of biomolecules, such as proteins, may be represented using different representations like space-fill, ballstick, backbone, or secondary structures. The secondary structure of proteins, comprising of sheet-like, helix-like and loops structures, r...
     
Morse-smale complexes for piecewise linear 3-manifolds
Found in: Proceedings of the nineteenth conference on Computational geometry (SCG '03)
By Herbert Edelsbrunner, John Harer, Valerio Pascucci, Vijay Natarajan
Issue Date:June 2003
pp. 361-370
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its 3-dimensional cells are shaped like crystals and are separated by quadrangular...
     
Loops in reeb graphs of 2-manifolds
Found in: Proceedings of the nineteenth conference on Computational geometry (SCG '03)
By Herbert Edelsbrunner, John Harer, Kree Cole-McLaughlin, Valerio Pascucci, Vijay Natarajan
Issue Date:June 2003
pp. 344-350
Given a Morse function f over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight upper and lower bounds on the number of loops in the Reeb graph that depend ...
     
 1