T. J. Peters 2005 IBM Faculty Award www.cse.uconn.edu/~tpeters with E. L. F. Moore & J. Bisceglio Computational Topology for Scientific Visualization and.

Slides:



Advertisements
Similar presentations
Interpolating curves.
Advertisements

Computer Graphics (Spring 2008) COMS 4160, Lecture 6: Curves 1
© University of Wisconsin, CS559 Spring 2004
COMPUTER GRAPHICS CS 482 – FALL 2014 OCTOBER 8, 2014 SPLINES CUBIC CURVES HERMITE CURVES BÉZIER CURVES B-SPLINES BICUBIC SURFACES SUBDIVISION SURFACES.
Geometric Modeling Notes on Curve and Surface Continuity Parts of Mortenson, Farin, Angel, Hill and others.
Jehee Lee Seoul National University
Slide 127 October 1999CS Computer Graphics (Top Changwatchai) Review of Spline Concepts Sections 10-6 to in Hearn & Baker Splines can be 2D.
MIT EECS 6.837, Durand and Cutler Curves & Surfaces.
3D Modeling Topics Gerald Farin Computer Science PRISM: Partnership for Research In Spatial Modeling ASU.
CS CS 175 – Week 9 B-Splines Blossoming, Bézier Splines.
T. J. Peters, University of Connecticut K. Abe, A. C. Russell, J. Bisceglio, E.. Moore, D. R. Ferguson, T. Sakkalis Topological.
Offset of curves. Alina Shaikhet (CS, Technion)
CSE 275 F04—Graphics with OpenGL Dr. T. J. Peters, Use of plain text files for No attachments.
Joel Daniels II University of Utah GDC Group Converting Molecular Meshes into Smooth Interpolatory Spline Solid Models Joel Daniels II Elaine Cohen David.
T. J. Peters Computational Topology : A Personal Overview.
T. J. Peters, University of Connecticut Computer Science Mathematics with K. Abe, J. Bisceglio, A. C. Russell, T. Sakkalis,
T. J. Peters Kerner Graphics Topologically Encoded Animation (TEA): History & Future.
T. J. Peters, Kerner Graphics & UConn Knots & Molecules in Animation, Simulation & Visualization TEA & ToAST.
ENDS 375 Foundations of Visualization Geometric Representation 9/30/04.
Modelling: Curves Week 11, Wed Mar 23
IE433 CAD/CAM Computer Aided Design and Computer Aided Manufacturing Part-4 Computer Graphics- CAD Software Industrial Engineering Program King Saud University.
T. J. Peters, University of Connecticut with I-TANGO Team, ++ Computational Topology for Animation and Simulation.
T. J. Peters, University of Connecticut K. Abe, J. Bisceglio, A. C. Russell Computational Topology on Approximated Manifolds.
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Curves Week 13, Mon 24 Nov 2003.
T. J. Peters, University of Connecticut 3D Graphics Projected onto 2D (Don’t be Fooled!!!!)
1 Representing Curves and Surfaces. 2 Introduction We need smooth curves and surfaces in many applications: –model real world objects –computer-aided.
T. J. Peters University of Connecticut, Professor TEA, Knots & Molecules in Animation, Simulation & Visualization.
T. J. Peters Kerner Graphics, Inc., CTO; University of Connecticut, Professor TEA, Knots & Molecules in Animation, Simulation & Visualization.
T. J. Peters, UConn Computer Science & Engineering Research & Education Topology & Animation : Science & Technology.
Splines III – Bézier Curves
Modeling. Topology Topology describes an object’s shape, number of spans, and degree. For polygon objects this includes vertex positions.
Graphics Programming, Byung-Gook Lee, Dongseo Univ., Graphics Programming Byung-Gook Lee Dongseo Univ.
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
Introduction Tracking the corners Camera model and collision detection Keyframes Path Correction Controlling the entire path of a virtual camera In computer.
A Survey on FFD Reporter: Gang Xu Mar 15, Overview Volumn-based FFD Surface-based FFD Curve-based FFD Point-based FFD Accurate FFD Future Work Outline.
CS 376 Introduction to Computer Graphics 04 / 23 / 2007 Instructor: Michael Eckmann.
Creating & Processing 3D Geometry Marie-Paule Cani
V. Space Curves Types of curves Explicit Implicit Parametric.
Crystallizing Topology in Molecular Visualizations Thomas J. Peters, Ph.D. Professor of Computer Science and Engineering Professor of Mathematics Digital.
Why manifolds?. Motivation We know well how to compute with planar domains and functions many graphics and geometric modeling applications involve domains.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Parametric surfaces.
CS 445/645 Fall 2001 Splines/Film/Animation. Final Exam Thursday, December 13 th from 7 – 10 p.m. –Room Olsson 011 You may use one sheet of notes (8.5.
Parametric Surfaces Define points on the surface in terms of two parameters Simplest case: bilinear interpolation s t s x(s,t)x(s,t) P 0,0 P 1,0 P 1,1.
View-dependent Adaptive Tessellation of Spline Surfaces
Geometric Modelling 2 INFO410 & INFO350 S Jack Pinches
Subject Name: Computer Graphics Subject Code: Textbook: “Computer Graphics”, C Version By Hearn and Baker Credits: 6 1.
Lee Byung-Gook Dongseo Univ.
04/18/02(c) 2002 University of Wisconsin Last Time Hermite Curves Bezier Curves.
1 Graphics CSCI 343, Fall 2015 Lecture 34 Curves and Surfaces III.
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
Foundations of Computer Graphics (Spring 2012) CS 184, Lecture 12: Curves 1
College of Computer and Information Science, Northeastern UniversityFebruary 27, CS U540 Computer Graphics Prof. Harriet Fell Spring 2009 Lectures.
Rendering Bezier Curves (1) Evaluate the curve at a fixed set of parameter values and join the points with straight lines Advantage: Very simple Disadvantages:
Kansas State University Department of Computing and Information Sciences CIS 736: Computer Graphics Lecture 13 of 42 Wednesday, 15 February 2006 William.
DPL3/10/2016 CS 551/651: Simplification Continued David Luebke
3-D Mesh Morphing By Newton Der.
Curves University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2013 Tamara Munzner.
Object Modeling: Curves and Surfaces CEng 477 Introduction to Computer Graphics.
Subdivision Schemes. Center for Graphics and Geometric Computing, Technion What is Subdivision?  Subdivision is a process in which a poly-line/mesh is.
Introduction to Parametric Curve and Surface Modeling.
Lecture 24: Surface Representation
CS5500 Computer Graphics May 11, 2006
CSE 167 [Win 17], Lecture 9: Curves 1 Ravi Ramamoorthi
© University of Wisconsin, CS559 Spring 2004
Generalization of (2n+4)-point approximating subdivision scheme
Viz, A Personal Overview Shapes vs Data
Max bigger small.
PPT9: Global and local interpolation
Introduction to Parametric Curve and Surface Modeling
Presentation transcript:

T. J. Peters 2005 IBM Faculty Award with E. L. F. Moore & J. Bisceglio Computational Topology for Scientific Visualization and Integration with Blue Gene L

Rotate Molecule?

UMass, RasMol

Molecular Modeling? Using Surfaces!

Joining Geometry

Static Images “A picture is worth a thousand words.” BUT, ( Animation is much more expensive

Dynamic Scientific Visualization Approximately 11M translations per hour: 100 translations per frame, at 30 frames per second (A Conservative Lower Bound)

Geri’s game: along boundary joins. Resolution was data-specific. Short time span was favorable DeRose, Kass and Truong, Subdivision surfaces in character animation, SIGGRAPH '98 Documented Animation Issues

Accumulated error versus Maya alternative. Used at BlueSky Studios (Ice Age II) Practical Animation Response

Mathematics for perturbing curves. Generalize to surfaces. Pragmatic Research Response

Approximation & Knots Approximate & compare knot types: But recognizing unknot in NP (Hass, L, P, 1998)!! Approximation as operation in geometric design Preserve original knot type (even if unknown).

Unknot

Bad Approximation! Self-intersect?

Good Approximation! Respects Embedding Via Curvature (local) Separation (global) (recognizing unknot in NP; Hass, L, P, 1998)

* Interpolation points* N r (B) B ➢ Construct the boundary of an open neighborhood N r (B) of curve B ➢ The boundary (a pipe surface) will have a radius r, with the following conditions* ➢ no local self-intersections ➢ no global self-intersections

Applications !

Subdivision for graphics Integration with sub-systems. Generation of vertices. Performance benefits. Motion driven by chemistry and physics.

P8P8 P7P7 P6P6 P5P5 P4P4 P3P3 P2P2 P1P1 P 10 P0P0 P9P9 ➢ Planar Degree 10 Bézier Curve ➢ Note: the control polygon is self-intersecting The Class of Unknotted Spline Curves with Knotted Control Polygons

Knot Projection Folk Lemma If a projection of a curve is non-self-intersecting, then the curve is unknotted.

Spline Projection Done by projection of control points.

➢ 3D Degree 10 Bézier Curve ➢ Note: the control polygon is knotted The Class of Unknotted Spline Curves with Knotted Control Polygons P0P0 P 10 P9P9 P8P8 P7P7 P6P6 P5P5 P3P3 P2P2 P1P1

Algorithm for Isotopic Subdivision (cubic) Subdividing B until its control polygon is contained in Nr(B). a. Compute number of subdivisions required* b. Test to ensure there are no self-intersections N r (B) B PkPk P k+1 P k+2 q k,i lklk l k+1 l k+3 P k+2 l k+2 q k,f * Cubic: no local knotting

2r Algorithm for Isotopic Subdivision 1. Computing r for B Find minimum of a. separation distance [c(s) – c(t)] c'(s) = 0 [c(s) – c(t)] c'(t) = 0 b. radius of curvature Cubic b-spline curve

Min distance with Newton's method

KnotPlot !

Crucial Difference Known Dynamics Versus Real-time Response (molecular simulation) (surgery)

Additional High Performance Issues Over 100,000 processors, with local geometry. Join across all nodes (surfaces & curves). Output to light-weight graphics clients raises bandwidth & architectural concerns. Example: Blue Gene L, Macro-Molecule Andersson-Peters-Stewart, IJCGA 00 & CAGD 98

Terabytes of point data. Triangulation too data intensive. Reduce by orders of magnitudes. Spline approximation, with acceptable loss. Example:Seismic Data, P. Bording, MUN, IBM Faculty Award

Only synthetic data. Order of magnitude reduction. Small loss. Awaiting test data. Status

Local constraints. Mathematically & algorithmically possible. Need domain-specific information. Options

Integrate Surface Approximation Provable Topological Dynamic Constraints Apply to real-time, computer-assisted cardiac surgery. Goals

Credits ROTATING IMMORTALITY – KnotPlot – contributions/scharein/KnotPlot.html

Acknowledgements, NSF I-TANGO,May 1, 2002, #DMS SGER: Computational Topology for Surface Reconstruction, NSF, October 1, 2002, #CCR SGER: Computational Topology for Surface Reconstruction, NSF, October 1, 2002, #CCR Computational Topology for Surface Approximation, September 15, 2004, #FMM Computational Topology for Surface Approximation, September 15, 2004, #FMM IBM Faculty Award, 2005