Scattered Data Visualization Shanthanand Kutuva Rabindranath Kiran V Bhaskar.

Slides:



Advertisements
Similar presentations
Data Visualization Lecture 4 Two Dimensional Scalar Visualization
Advertisements

Generating Realistic Terrains with Higher-Order Delaunay Triangulations Thierry de Kok Marc van Kreveld Maarten Löffler Center for Geometry, Imaging and.
Interpolation A standard idea in interpolation now is to find a polynomial pn(x) of degree n (or less) that assumes the given values; thus (1) We call.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
電腦視覺 Computer and Robot Vision I
Application of Angle-Preserving Parameterization: Remeshing.
4/29/2015 Wireless Sensor Networks COE 499 Deployment of Sensor Networks II Tarek Sheltami KFUPM CCSE COE
Ruslana Mys Delaunay Triangulation Delaunay Triangulation (DT)  Introduction  Delaunay-Voronoi based method  Algorithms to compute the convex hull 
Geometric aspects of variability. A simple building system could be schematically conceived as a spatial allocation of cells, each cell characterized.
by Rianto Adhy Sasongko Supervisor: Dr.J.C.Allwright
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Visualization and graphics research group CIPIC Decimation of Triangle Meshes William J. Schroeder, Jonathan A. Zarge, William E. Lorensen Presented by.
Nice, 17/18 December 2001 Adaptive Grids For Bathymetry Mapping And Navigation Michel Chedid and Maria-João Rendas I3S - MAUVE.
1cs542g-term Notes. 2 Meshing goals  Robust: doesn’t fail on reasonable geometry  Efficient: as few triangles as possible Easy to refine later.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
Yingcai Xiao SCATTERED DATA VISUALIZATION. Scattered Data: sample points distributed unevenly and non-uniformly throughout the volume of interest. Example.
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Real-time Combined 2D+3D Active Appearance Models Jing Xiao, Simon Baker,Iain Matthew, and Takeo Kanade CVPR 2004 Presented by Pat Chan 23/11/2004.
The Terms that You Have to Know! Basis, Linear independent, Orthogonal Column space, Row space, Rank Linear combination Linear transformation Inner product.
Introduction to the 176A labs and ArcGIS Acknowledgement: Slides by David Maidment, U Texas-Austin and Francisco Olivera (TAMU)
Introduction to Programming with C++ Fourth Edition
Searching and Sorting Arrays
Quadtrees and Mesh Generation Student Lecture in course MATH/CSC 870 Philipp Richter Thursday, April 19 th, 2007.
Fluid Surface Rendering in CUDA Andrei Monteiro Marcelo Gattass Assignment 4 June 2010.
ECS 289L A Survey of Mesh-Based Multiresolution Representations Ken Joy Center for Image Processing and Integrated Computing Computer Science Department.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
Lecture II-2: Probability Review
Spatial data models (types)
Volumetric and Blobby Objects Lecture 8 (Modelling)
VTK: Data Shroeder et al. Chapter 5 University of Texas – Pan American CSCI 6361, Spring 2014 After Taku Komura and other lecture sets
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Rendering Adaptive Resolution Data Models Daniel Bolan Abstract For the past several years, a model for large datasets has been developed and extended.
Intro. To GIS Lecture 9 Terrain Analysis April 24 th, 2013.
Mesh Generation 58:110 Computer-Aided Engineering Reference: Lecture Notes on Delaunay Mesh Generation, J. Shewchuk (1999)
CSCI 256 Data Structures and Algorithm Analysis Lecture 14 Some slides by Kevin Wayne copyright 2005, Pearson Addison Wesley all rights reserved, and some.
Processing Images and Video for an Impressionist Effect Author: Peter Litwinowicz Presented by Jing Yi Jin.
CSC141- Introduction to Computer programming Teacher: AHMED MUMTAZ MUSTEHSAN Lecture – 19 Thanks for Lecture Slides:
Arrays Module 6. Objectives Nature and purpose of an array Using arrays in Java programs Methods with array parameter Methods that return an array Array.
Spatial Databases: Digital Terrain Model Spring, 2015 Ki-Joune Li.
Introduction to SPSS. Object of the class About the windows in SPSS The basics of managing data files The basic analysis in SPSS.
Min Chen School of Computer Science and Engineering Seoul National University Data Structure: Chapter 3.
D. M. J. Tax and R. P. W. Duin. Presented by Mihajlo Grbovic Support Vector Data Description.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Generating Realistic Terrains with Higher-Order Delaunay Triangulations Thierry de Kok Marc van Kreveld Maarten Löffler Center for Geometry, Imaging and.
CS558 Project Local SVM Classification based on triangulation (on the plane) Glenn Fung.
Data Abstraction and Time-Series Data CS 4390/5390 Data Visualization Shirley Moore, Instructor September 15,
Hank Childs, University of Oregon Isosurfacing (Part 3)
L8 - Delaunay triangulation L8 – Delaunay triangulation NGEN06(TEK230) – Algorithms in Geographical Information Systems.
Delaunay Triangulation on the GPU
Machine Learning CUNY Graduate Center Lecture 2: Math Primer.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
1 Chapter 9 Searching And Table. 2 OBJECTIVE Introduces: Basic searching concept Type of searching Hash function Collision problems.
UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.
CHAPTER EIGHT ARRAYS © Prepared By: Razif Razali1.
JAVA: An Introduction to Problem Solving & Programming, 5 th Ed. By Walter Savitch and Frank Carrano. ISBN © 2008 Pearson Education, Inc., Upper.
Arrays Chapter 7. MIS Object Oriented Systems Arrays UTD, SOM 2 Objectives Nature and purpose of an array Using arrays in Java programs Methods.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Geo479/579: Geostatistics Ch10. Global Estimation.
3/3/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Delaunay Triangulations I Carola Wenk Based on: Computational.
An algorithm for triangulating multiple 3D polygons M Zou, T Ju, N Carr Eurographics Symposium on Geometry Processing 2013 Who? Kundan Krishna 1 From?
Processing Images and Video for An Impressionist Effect Automatic production of “painterly” animations from video clips. Extending existing algorithms.
IENG-385 Statistical Methods for Engineers SPSS (Statistical package for social science) LAB # 1 (An Introduction to SPSS)
Correspondence search using Delaunay triangulation Rishu Gupta
ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.
Arrays Chapter 7.
Spectral Methods for Dimensionality
Common Classification Tasks
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Presentation transcript:

Scattered Data Visualization Shanthanand Kutuva Rabindranath Kiran V Bhaskar

Contents  Scattered Data….a brief introduction.  Data Description.  Several Possible Approaches.  Delaunay Triangulation.  Limitations to visualize scattered data.  Our Approach-system design  Implementation Considerations  Demo.  Future work.

Scattered Data-A brief introduction Topology & Geometry Examples- Geophysical and Bio-physical data Fig: Geophysical Data in 3D space

Data Description Three Dimensional Data. Three columns representing each axes. Fourth column representing the scalar value. Data Normalization.

Several Approaches  Splatting  Interpolation

Delaunay Triangulation “An optimal triangulation, which satisfies, the circum-sphere condition “. Optimal Triangulation: “A triangulation which generates maximized minimum angles”. Circum-sphere Condition. 2D-“The minimum interior angle of a triangle in Delaunay’s triangulation is greater than or equal to the minimum interior angle of any other possible triangulation.” Edge Swapping

Limitations to visualize scattered data   Scattered density data can be difficult to visualize, particularly when the data do not lie on a regular grid.   It is difficult to visualize scattered data if it contains regions of sparse measurements. This often occurs in geophysical or biophysical data.   Even using Triangulation, if the points are arranged on a regular lattice(degenerate points), there are several possible triangulations possible. The choice of triangulation depends on the order of data input.   Points that are coincident (or nearly so) may be discarded by the algorithm. This is because the Delaunay triangulation requires unique input points. This can be overcome by controlling definition of coincidence using the “tolerance” instance variable.

System Design Data set we have is a 3D dataset Store it in a double array Store the concentration value as a scalar value. A Count Id to keep track of points used.

Implementation Considerations We are expected to consider the following conditions before implementing.  · preserve input data values.  · produce meaningful output values.  · provide error estimations.  · accept additional constraints.  · reduce the requirement on the sampling intensity.

Demo  Click here

Future Work  We wish to extend the same to a larger dataset.  A high resolution color table  Visualize the same data using other methods and compare.