T. J. Peters www.cse.uconn.edu/~tpeters Computational Topology : A Personal Overview.

Slides:



Advertisements
Similar presentations
BREPS solids construction by surfaces of extrusion & revolution
Advertisements

M. Belkin and P. Niyogi, Neural Computation, pp. 1373–1396, 2003.
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Differential geometry I
The Unknot, the Trefoil Knot, and the Figure-Eight Knot are Mutually Nonequivalent An Elementary Proof Jimmy Gillan Thursday, April 10, 2008.
Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.
Discrete Geometry Tutorial 2 1
Topological Data Analysis
Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
Operators in CAD Systems
T. J. Peters, University of Connecticut K. Abe, A. C. Russell, J. Bisceglio, E.. Moore, D. R. Ferguson, T. Sakkalis Topological.
Tracking Intersection Curves of Two Deforming Parametric Surfaces Xianming Chen¹, Richard Riesenfeld¹ Elaine Cohen¹, James Damon² ¹School of Computing,
CSE 275 F04—Graphics with OpenGL Dr. T. J. Peters, Use of plain text files for No attachments.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 I THE NATURAL PSEUDODISTANCE:
Recognizing Strings in NP Marcus Schaefer, Eric Sedgwick, Daniel Štefankovič Presentation by Robert Salazar.
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.
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.
12/06/00 Dinesh Manocha, COMP258 Solid Modeling CSG (Constructive Solid Geometry) Representations: A set theoretic Boolean expression of primitive solid.
Representation Issues in Data Exchange for RP-LM Sara McMains U.C. Berkeley.
T. J. Peters 2005 IBM Faculty Award with E. L. F. Moore & J. Bisceglio Computational Topology for Scientific Visualization and.
Blending Surfaces. Introduction Blending n. 1. The act of mingling Webster 2. (Paint.) The method of laying on different tints so that they may.
We build a surface between two complex closed spatial spline curves. Our algorithm allows the input curves to have differing degree, parameterization,
T. J. Peters, University of Connecticut with I-TANGO Team, ++ Computational Topology for Animation and Simulation.
Complete Path Planning for Planar Closed Chains Among Point Obstacles Guanfeng Liu and Jeff Trinkle Rensselaer Polytechnic Institute.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
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.
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
T. J. Peters, UConn Computer Science & Engineering Research & Education Topology & Animation : Science & Technology.
Mathematical Physics Seminar Notes Lecture 1 Global Analysis and Lie Theory Wayne M. Lawton Department of Mathematics National University of Singapore.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Skills of GEOMETRIC THINKING in undergraduate level Arash Rastegar Assistant Professor Sharif University of Technology.
CSE 788 X.14 Topics in Computational Topology: --- An Algorithmic View Lecture 1: Introduction Instructor: Yusu Wang.
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.
1 Background and definitions Cindy Grimm. 2 Siggraph 2005, 8/1/ Overview What does it mean to be.
11 July 2002 Reverse Engineering 1 Dr. Gábor Renner Geometric Modelling Laboratory, Computer and Automation Research Institute.
Disediakan oleh Suriati bte Sadimon GMM, FSKSM, UTM, 2004 SOLID MODELLING.
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.
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
Why manifolds?. Motivation We know well how to compute with planar domains and functions many graphics and geometric modeling applications involve domains.
1 Manifolds from meshes Cindy Grimm and John Hughes, “Modeling Surfaces of Arbitrary Topology using Manifolds”, Siggraph ’95 J. Cotrina Navau and N. Pla.
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
A construction of rational manifold surfaces of arbitrary topology and smoothness from triangular meshes Presented by: LiuGang
Topology By: Jarek Esswein.
§1.2 Differential Calculus Christopher Crawford PHY 416G
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
12.1 Exploring Solids.
Introductory Notes on Geometric Aspects of Topology PART I: Experiments in Topology 1964 Stephen Barr (with some additional material from Elementary Topology.
CSE 5559 Computational Topology: Theory, algorithms, and applications to data analysis Lecture 0: Introduction Instructor: Yusu Wang.
Why manifolds?. Motivation We know well how to compute with planar domains and functions many graphics and geometric modeling applications involve domains.
CS552: Computer Graphics Lecture 28: Solid Modeling.
Shape Dimension and Approximation from Samples
Morphing and Shape Processing
Computer Aided Engineering Design
Subhash Khot Theory Group
Computer Aided Engineering Design
Lecture 27: Solid Modeling
Viz, A Personal Overview Shapes vs Data
A Survey of Knots and Links
Max bigger small.
Discrete Surfaces and Manifolds: A Potential tool to Image Processing
Spin Models and Distance-Regular Graphs
Presentation transcript:

T. J. Peters Computational Topology : A Personal Overview

Outline My Topological Emphasis History (3 Perspectives) Equivalence classes as broad mathematics Specific emphasis upon geometric design

My Topological Emphasis: General Topology (Point-Set Topology) Mappings and Equivalences

Vertex, Edge, Face: Connectivity Euler Operations Thesis: M. Mantyla; “Computational Topology …”, 1983.

Regular Closed Sets: Closed Algebra Boolean Operations A. Requicha

Non-manifold Topology K. J. Weiler (Mixed Dimensional (N. F. Stewart))

Contemporary Influences Grimm: Manifolds, charts, blending functions Blackmore: differential sweeps Kopperman, Herman: Digital topology Edelsbrunner, Zomordian, Carlsson : Algebraic

KnotPlot !

Comparing Knots Reduced two to simplest forms Need for equivalence Approximation as operation in geometric design

Unknot

Bad Approximation! Self-intersect?

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

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

Another View Approximation as operation in geometric design Need for equivalence Equivalence classes: –Algebra: homorphisms & groups –General topology: homeomorphisms & spaces –Knot theory: isotopies & knots

NSF Workshop 1999 for Design Organized by D. R. Ferguson & R. Farouki SIAM News: Danger of self-intersections Crossings not detected by algorithms Would appear as intersections in projections Strong criterion for ‘lights-out’ manufacturing

Summary – Key Ideas Space Curves: intersection versus crossing Local and global arguments Knot equivalence via isotopy Extensions to surfaces

UMass, RasMol

Proof: 1. Local argument with curvature. 2. Global argument for separation. (Similar to flow on normal field.) Theorem: If an approximation of F has a unique intersection with each normal of F, then it is ambient isotopic to F.

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

Global separation

Tubular Neighborhoods Depends upon estimates of these values. Similar to medial axis, but avoids its explicit construction, which can be unstable!! and Ambient Isotopy

Mathematical Generalizations Equivalence classes: –Knot theory: isotopies & knots –General topology: homeomorphisms & spaces –Algebra: homorphisms & groups Manifolds (without boundary or with boundary)

Overview References Computation Topology Workshop, Summer Topology Conference, July 14, ‘05, Denison, planning with Applied General Topology NSF, Emerging Trends in Computational Topology, 1999, xxx.lanl.gov/abs/cs/ Open Problems in Topology 2 (problems!!) I-TANGO,Regular Closed Sets (Top Atlas)

Credits ROTATING IMMORTALITY – KnotPlot –

Credits IBM Molecule – rscd.bluegene-picaa.html Protein – Enzyme Complex – b.jpg

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