T. J. Peters, University of Connecticut www.cse.uconn.edu/~tpeters with I-TANGO Team, ++ Computational Topology for Animation and Simulation.

Slides:



Advertisements
Similar presentations
Department of Computer Science and Engineering Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method Tamal K. DeyGang LiJian.
Advertisements

Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
Surface Reconstruction From Unorganized Point Sets
Greedy Routing with Guaranteed Delivery Using Ricci Flow Jie Gao Stony Brook University Rik Sarkar, Xiaotian Yin, Feng Luo, Xianfeng David Gu.
Junjie Cao 1, Andrea Tagliasacchi 2, Matt Olson 2, Hao Zhang 2, Zhixun Su 1 1 Dalian University of Technology 2 Simon Fraser University Point Cloud Skeletons.
Support Vector Machines
Proximity graphs: reconstruction of curves and surfaces
Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.
Discrete Geometry Tutorial 2 1
A Simple and Robust Thinning Algorithm on Cell Complexes
Complex Networks for Representation and Characterization of Object For CS790g Project Bingdong Li 11/9/2009.
Estimating Surface Normals in Noisy Point Cloud Data Niloy J. Mitra, An Nguyen Stanford University.
Surface to Surface Intersection N. M. Patrikalakis, T. Maekawa, K. H. Ko, H. Mukundan May 25, 2004.
T. J. Peters, University of Connecticut K. Abe, A. C. Russell, J. Bisceglio, E.. Moore, D. R. Ferguson, T. Sakkalis Topological.
Curvature Motion for Union of Balls Thomas Lewiner ♥♠, Cynthia Ferreira ♥, Marcos Craizer ♥ and Ralph Teixeira ♣ ♥ Department of Mathematics — PUC-Rio.
CSE 275 F04—Graphics with OpenGL Dr. T. J. Peters, Use of plain text files for No attachments.
Filling Holes in Complex Surfaces using Volumetric Diffusion James Davis, Stephen Marschner, Matt Garr, Marc Levoy Stanford University First International.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Geometry and Graphics Accuracy T. J. Peters, UConn, CSE Geometric Accuracy: Geometric Accuracy: Graphics Is Not the Only Show in Town!Graphics Is Not the.
Niloy J. Mitra1, Natasha Gelfand1, Helmut Pottmann2, Leonidas J
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,
SIAM Conf. on Math for Industry, Oct. 10, 2009 Modeling Knots for Aesthetics and Simulations Carlo H. Séquin U.C. Berkeley Modeling, Analysis, Design …
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.
T. J. Peters 2005 IBM Faculty Award with E. L. F. Moore & J. Bisceglio Computational Topology for Scientific Visualization and.
T. J. Peters, University of Connecticut K. Abe, J. Bisceglio, A. C. Russell Computational Topology on Approximated Manifolds.
T. J. Peters, University of Connecticut 3D Graphics Projected onto 2D (Don’t be Fooled!!!!)
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.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
Robust Statistical Estimation of Curvature on Discretized Surfaces Evangelos Kalogerakis Patricio Simari Derek Nowrouzezahrai Karan Singh Symposium on.
Motion from normal flow. Optical flow difficulties The aperture problemDepth discontinuities.
T. J. Peters, UConn Computer Science & Engineering Research & Education Topology & Animation : Science & Technology.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Shape Spaces Kathryn Leonard 22 January 2005 MSRI Intro to Image Analysis.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
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 Quadric Error Metrics 1/20 Quadric Error Metrics.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
Reconstructing 3D mesh from video image sequences supervisor : Mgr. Martin Samuelčik by Martin Bujňák specifications Master thesis
Scalable and Fully Distributed Localization With Mere Connectivity.
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.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Plenoptic Modeling: An Image-Based Rendering System Leonard McMillan & Gary Bishop SIGGRAPH 1995 presented by Dave Edwards 10/12/2000.
Simplified Smoothed Particle Hydrodynamics for Interactive Applications Zakiya Tamimi Richard McDaniel Based on work done at Siemens Corporate.
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
GRASP Learning a Kernel Matrix for Nonlinear Dimensionality Reduction Kilian Q. Weinberger, Fei Sha and Lawrence K. Saul ICML’04 Department of Computer.
CSE554SkeletonsSlide 1 CSE 554 Lecture 2: Shape Analysis (Part I) Fall 2015.
Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
Optical Flow. Distribution of apparent velocities of movement of brightness pattern in an image.
A New Voronoi-based Reconstruction Algorithm
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
Docking III: Matching via Critical Points Yusu Wang Joint Work with P. K. Agarwal, H. Edelsbrunner, J. Harer Duke University.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
Differentials A quick Review on Linear Approximations and Differentials of a function of one Variable.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Introduction to Scale Space and Deep Structure. Importance of Scale Painting by Dali Objects exist at certain ranges of scale. It is not known a priory.
Curve Simplification under the L 2 -Norm Ben Berg Advisor: Pankaj Agarwal Mentor: Swaminathan Sankararaman.
Lecture 9 : Point Set Processing
CSE 554 Lecture 2: Shape Analysis (Part I)
Image Representation and Description – Representation Schemes
Semi-Supervised Clustering
Viz, A Personal Overview Shapes vs Data
A Survey of Knots and Links
Max bigger small.
HALO-FREE DESIGN FOR RETINEX BASED REAL-TIME VIDEO ENHANCEMENT SYSTEM
Presentation transcript:

T. J. Peters, University of Connecticut with I-TANGO Team, ++ Computational Topology for Animation and Simulation

Outline: Animation & Approximation Animations for 3D Algorithms Applications

Animation for Understanding ROTATING IMMORTALITY – –Möbius Band in the form of a Trefoil Knot Animation makes 3D more obvious

Unknot

Bad Approximation Why? Curvature? Separation?

Why Bad? No Intersections! Changes Knot Type Now has 4 Crossings

Good Approximation All Vertices on Curve Respects Embedding Via Curvature (local) Separation (global)

Summary – Key Ideas Curves –Don’t be deceived by images (3D !) –Crossings versus self-intersections Local and global arguments Knot equivalence via isotopy

KnotPlot !

Initial Assumptions on a 2-manifold, M Without boundary 2 nd derivatives are continuous (curvature)

T

Proof: Similar to flow on normal field. Comment: Points need not be on surface. (noise!) Theorem: Any approximation of F in T such that each normal hits one point of W is ambient isotopic to F.

Tubular Neighborhoods Its radius defined by ½ minimum –all radii of curvature on 2-manifold –global separation distance. Estimates, but more stable than medial axis. and Ambient Isotopy

Medial Axis H. Blum, biology, classification by skeleton Closure of the set of points that have at least 2 nearest neighbors on M

X

Opportunities Bounds for animation & simulation –Surfaces move –Boundaries move Functions to represent movement

Seminal Paper, Modified Claim Surface reconstruction from unorganized points, H. Hoppe, T. DeRose, et al., 26 (2), Siggraph, `92 The output of our reconstruction method produced the correct topology in all the examples. We are trying to develop formal guarantees on the correctness of the reconstruction, given constraints on the sample and the original surface

KnotPlot ! Perko Pair & Dynamic Drug Docking

Animation & Simulation Successive Frames O(N^2) run time risk of error versus step size Isotopy O(N^2) off-line simple bound comparison at run time formal correctness IBM Award Nomination (Blue Gene)

Mini-Literature Comparison Similar to D. Blackmore in his sweeps also entail differential topology concepts Different from H. Edelsbrunner emphasis on PL-approximations from Alpha-shapes, even with invocation of Morse theory. Computation Topology Workshop, Summer Topology Conference, July 14, ‘05, Denison. –Digital topology, domain theory –Generalizations, unifications?

Credits Color image: UMass, Amherst, RasMol, web Molecular Cartoons: T. Schlick, survey article, Modeling Superhelical DNA …, C. Opinion Struct. Biol., 1995

INTERSECTIONS -- TOPOLOGY, ACCURACY, & NUMERICS FOR GEOMETRIC OBJECTS I-TANGO III NSF/DARPA

Acknowledgements, NSF I-TANGO: Intersections --- Topology, Accuracy and Numerics for Geometric Objects (in Computer Aided Design), May 1, 2002, #DMS I-TANGO: Intersections --- Topology, Accuracy and Numerics for Geometric Objects (in Computer Aided Design), 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,Computational Topology for Surface Approximation, September 15, 2004, #FMM

Scientific Collaborators I-TANGO: D. R. Ferguson (Boeing),I-TANGO: C. M. Hoffmann (Purdue), T. Maekawa (MIT), N. M. Patrikalakis (MIT), N. F. Stewart (U Montreal), T. Sakalis (Agr. U. Athens). Surface Approximation: K. Abe, A. Russell,Surface Approximation: E. L. F. Moore, J. Bisceglio, C. Mow