Representing Higher Order Vector Fields Singularities on Piecewise Linear Surfaces Wan Chiu Li Bruno Vallet Nicolas Ray Bruno Lévy IEEE Visualization 2006.

Slides:



Advertisements
Similar presentations
COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.
Advertisements

GATE Reconstruction from Point Cloud (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager.
Exploration of bump, parallax, relief and displacement mapping
Discrete Differential Geometry Planar Curves 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine, Eitan Grinspun.
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
Computer graphics & visualization Global Illumination Effects.
An Introduction to Light Fields Mel Slater. Outline Introduction Rendering Representing Light Fields Practical Issues Conclusions.
1/20 Using M-Reps to include a-priori Shape Knowledge into the Mumford-Shah Segmentation Functional FWF - Forschungsschwerpunkt S092 Subproject 7 „Pattern.
Spherical Harmonic Lighting of Wavelength-dependent Phenomena Clifford Lindsay, Emmanuel Agu Worcester Polytechnic Institute (USA)
An Efficient Multigrid Solver for (Evolving) Poisson Systems on Meshes Misha Kazhdan Johns Hopkins University.
On Triangle/Quad Subdivision Scott Schaefer and Joe Warren TOG 22(1) 28 – 36, 2005 Reporter: Chen zhonggui
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
CS Peter Schröder Subdivision I: The Basic Ideas.
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
IN4151 Introduction 3D graphics 1 Introduction to 3D computer graphics part 2 Viewing pipeline Multi-processor implementation GPU architecture GPU algorithms.
Texture Synthesis on Surfaces Paper by Greg Turk Presentation by Jon Super.
Polygonal Meshes 3D Object Representation -Tyler Abrams.
Vector Field Topology Josh Levine Overview Vector fields (VFs) typically used to encode many different data sets: –e.g. Velocity/Flow, E&M, Temp.,
©Larry F. Hodges (modified by Amos Johnson) 1 Shading Models.
CS Subdivision I: The Univariate Setting Peter Schröder.
Smooth Geometry Images Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe Warren.
The Story So Far The algorithms presented so far exploit: –Sparse sets of images (some data may not be available) –User help with correspondences (time.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction October IEEE Vis Filip Sadlo, Ronald CGL -
Polygon Shading. Assigning color to a shape to make graphical scenes look realistic, or artistic, or whatever effect we’re attempting to achieve But first.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
C O M P U T E R G R A P H I C S Stuff Jian Chen January 15, 2010 Transformations 1/10 Describing Shape By Andries van Dam.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Spline curves 1/23 Curves and Surfaces.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Efficient Irradiance Normal Mapping Ralf Habel, Michael Wimmer Institute of Computer Graphics and Algorithms Vienna University of Technology.
COLLEGE OF ENGINEERING UNIVERSITY OF PORTO COMPUTER GRAPHICS AND INTERFACES / GRAPHICS SYSTEMS JGB / AAS 1 Shading (Shading) & Smooth Shading Graphics.
Different options for the assimilation of GPS Radio Occultation data within GSI Lidia Cucurull NOAA/NWS/NCEP/EMC GSI workshop, Boulder CO, 28 June 2011.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Geometry Images Xiang Gu Harvard University Steven J. Gortler Harvard university Hugues Hoppe Microsoft Research Some slides taken from Hugues Hoppe.
03/24/03© 2003 University of Wisconsin Last Time Image Based Rendering from Sparse Data.
Introduction to Computer Graphics: Object Representation Rama C Hoetzlein, 2010 Univ. of California Santa Barbara Lecture Notes.
Controlling a Virtual Camera Ross Ptacek University of Alabama Birmingham.
- Laboratoire d'InfoRmatique en Image et Systèmes d'information
CS 325 Introduction to Computer Graphics 03 / 29 / 2010 Instructor: Michael Eckmann.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
The Search for Swirl and Tumble Motion Robert S. Laramee Department of Computer Science Swansea University Wales, UK.
Lee Byung-Gook Dongseo Univ.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Greg Humphreys CS445: Intro Graphics University of Virginia, Fall 2003 Subdivision Surfaces Greg Humphreys University of Virginia CS 445, Fall 2003.
Real-Time Relief Mapping on Arbitrary Polygonal Surfaces Fabio Policarpo Manuel M. Oliveira Joao L. D. Comba.
Discontinuous Displacement Mapping for Volume Graphics, Volume Graphics 2006, July 30, Boston, MA Discontinuous Displacement Mapping for Volume Graphics.
CSCE 441: Keyframe Animation/Smooth Curves (Cont.) Jinxiang Chai.
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
Raster Data Models: Data Compression Why? –Save disk space by reducing information content –Methods Run-length codes Raster chain codes Block codes Quadtrees.
Why manifolds?. Motivation We know well how to compute with planar domains and functions many graphics and geometric modeling applications involve domains.
Working Group « Pre-Filtering »
Practical 3D Frame Field Generation
POLYGON MESH Advance Computer Graphics
Decimation Of Triangle Meshes
Farthest Point Seeding for Efficient Placement of Streamlines
Image Space Based Visualization of Unsteady Flow on Surfaces
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Mesh Parameterization: Theory and Practice
Asymptotic Analysis of Spin Foam Amplitude with Timelike Triangles: Towards emerging gravity from spin foam models Hongguang Liu Centre de Physique Theorique,
CSCE 441: Keyframe Animation/Smooth Curves (Cont.)
Delaunay Triangulation & Application
Three-Dimensional Object Representation
Subdivision Surfaces 고려대학교 컴퓨터 그래픽스 연구실 cgvr.korea.ac.kr.
Chapter 5: Morse functions and function-induced persistence
Multiple Integrals.
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

Representing Higher Order Vector Fields Singularities on Piecewise Linear Surfaces Wan Chiu Li Bruno Vallet Nicolas Ray Bruno Lévy IEEE Visualization 2006 IEEE Visualization 2006 Baltimore, USA alice.loria.fr

1.Introduction 2.Discrete representation 3.Singularities 4.Encoding an existing vector field 5.LIC-based visualization 6.Conclusion Outline

What is a vector field singularity ?What is a vector field singularity ? It is a 0 of the fieldIt is a 0 of the field How can we characterize singularities ?How can we characterize singularities ? By their index =By their index = Introduction +1 dθdθdθdθ

What is a vector field singularity ?What is a vector field singularity ? It is a 0 of the fieldIt is a 0 of the field How can we characterize singularities ?How can we characterize singularities ? By their index =By their index = Introduction dθdθdθdθ -2 +2

How can we visualize a singularity ? Piecewise linear methods: index [-val/2+1, val/2+1] Introduction [Tricoche00]

How can we visualize a singularity ? Piecewise linear methods: index [-val/2+1, val/2+1] Higher order singularities: index Higher order singularities: index Introduction

Basic idea:Basic idea: 2D vectors are complex re iθ2D vectors are complex re iθ Interpolate r and θInterpolate r and θ Justification:Justification: Singularity = ( r =0, θ undefined)Singularity = ( r =0, θ undefined) Singularity index depend only on θ in neighborhoodSingularity index depend only on θ in neighborhood Introduction

On triangulated meshes Dual vertex-edge encoding using polar coordinates:Dual vertex-edge encoding using polar coordinates: Dual vertices: norm r, angle θDual vertices: norm r, angle θ Dual edges: period jump pDual edges: period jump p 3 Step interpolation (0D, 1D, 2D)3 Step interpolation (0D, 1D, 2D) Dual vertices=Facet centers (0D)Dual vertices=Facet centers (0D) Dual edges (1D)Dual edges (1D) Subdivision simplex (2D)Subdivision simplex (2D) Discrete representation

v* x(v*) θ(v*) θ(v*) : measured from a reference vector x(v*) θ(v*) : measured from a reference vector x(v*) r(v*) : vector norm, basis independent r(v*) : vector norm, basis independent 0D r(v*)

e* x(v*) P Linear interpolation: (e*) : height ratio,θ(e*) : angular variation along e* (e*) : height ratio,θ(e*) : angular variation along e* 1D θ(P) = θ(v*) + θ(e*) (e*)t v* x(v*) θ(v*) v*

e* x(v*) P Linear interpolation: (e*) : height ratio,θ(e*) : angular variation along e* (e*) : height ratio,θ(e*) : angular variation along e* 1D θ(P) = θ(v*) + θ(e*)(1- (e*))t v* x(v*) θ(v*) v*

1D H e* h Height ratio: (e*) = h/H (e*) = h/H 1- (e*) = h/H v* v* h

1D p( e* ) = -1 θ(e*) = dθ = θ(B) - θ(A) + 2 π p(e*)θ(e*) = dθ = θ(B) - θ(A) + 2 π p(e*) Angular variation along e* : e* Period Jump: e* B A p( e* ) = 1 e* B A e* B A p( e* ) = 0

1D

Subdivision simplex 2D

2D

A variant the side-vertex interpolation [Nielson79] Linear along the sideLinear along the side Constant along a side-vertex path (=side value)Constant along a side-vertex path (=side value) side vertex 2D P P

Singularities may occur only at verticesSingularities may occur only at vertices Singularity index depends only on period jumps :Singularity index depends only on period jumps : I( v ) = dθ = I 0 ( v ) + p(e*) Singularities f* e*f* v f*f*

Advantages: 1.Control over placement and index of singularities 2.Coherent with Poincare-Hopf index theorem 3.Index independent of the valence 4.Easy extension to fractional indices Singularities

Fractional indices appear in N-symmetry vector fields : Not vectors but equivalence class of vectors by NNot vectors but equivalence class of vectors by N u N v k | u=R(v, 2kπ/N)u N v k | u=R(v, 2kπ/N) Period jump and Indices are multiples of 1/NPeriod jump and Indices are multiples of 1/N Extension to fractional indices -1/2 +1/2

Fractional indices appear in N-symmetry vector fields : Not vectors but equivalence class of vectors by NNot vectors but equivalence class of vectors by N u N v k | u=R(v, 2kπ/N)u N v k | u=R(v, 2kπ/N) Period jump and Indices are multiples of 1/NPeriod jump and Indices are multiples of 1/N Extension to fractional indices -1/4 +1/4

1.r(v*) : norm of the vector at facet center v* 2.θ(v*) : choose one of the 3 edges and compute angle 3.2πp( e* )=θ(e*) - ( x(v*), x(v*) ) - θ( v* ) + θ( v* ) Requires an interpolation or an analytic form: Encoding an Existing Vector Field e* ||v|| 2 e* θ = dθ =θ = dθ = v x dv y – v y dv x

Encoding an Existing Vector Field e* v* v* dθdθdθdθ e* θ = dθ = (v x dv y – v y dv x ) / ||v|| 2θ = dθ = (v x dv y – v y dv x ) / ||v|| 2 e*

GPU acceleratedGPU accelerated Works in image spaceWorks in image space 3 passes3 passes Ensure geometric discontinuity (in depth buffer) Direction on the surface (in fragment shader) Line integral convolution (in image space) LIC-based Visualization [Laramee et. al. 03] [Van Wijk 03]

Results Index = -3 Index = 5

Results

Dual vertex-edge encoding + 3 steps interpolation: A very good candidate for visualizing non-linear vector fields on piecewise linear surfaces or 2d meshes.A very good candidate for visualizing non-linear vector fields on piecewise linear surfaces or 2d meshes. Efficient and simple way to visualize arbitrary singularitiesEfficient and simple way to visualize arbitrary singularities Easy generalization to fractional indicesEasy generalization to fractional indices Easier particularization to 2d fieldsEasier particularization to 2d fields Conclusion

Smooth non singular verticesSmooth non singular vertices Topological operationsTopological operations Trace streamlinesTrace streamlines Extension to 3d vector fieldsExtension to 3d vector fields Future work

Questions ? alice.loria.fr