T. J. Peters, University of Connecticut www.cse.uconn.edu/~tpeters K. Abe, A. C. Russell, J. Bisceglio, E.. Moore, D. R. Ferguson, T. Sakkalis Topological.

Slides:



Advertisements
Similar presentations
電腦視覺 Computer and Robot Vision I
Advertisements

Differential geometry I
Surface Reconstruction From Unorganized Point Sets
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.
Proximity graphs: reconstruction of curves and surfaces
1/20 Using M-Reps to include a-priori Shape Knowledge into the Mumford-Shah Segmentation Functional FWF - Forschungsschwerpunkt S092 Subproject 7 „Pattern.
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
Sample Shuffling for Quality Hierarchic Surface Meshing.
Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.
Discrete Geometry Tutorial 2 1
1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton.
Corp. Research Princeton, NJ Cut Metrics and Geometry of Grid Graphs Yuri Boykov, Siemens Research, Princeton, NJ joint work with Vladimir Kolmogorov,
Complex Networks for Representation and Characterization of Object For CS790g Project Bingdong Li 11/9/2009.
Asst. Prof. Yusuf Sahillioğlu
Estimating Surface Normals in Noisy Point Cloud Data Niloy J. Mitra, An Nguyen Stanford University.
Uncertainty and Variability in Point Cloud Surface Data Mark Pauly 1,2, Niloy J. Mitra 1, Leonidas J. Guibas 1 1 Stanford University 2 ETH, Zurich.
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.
1 GEOMETRIE Geometrie in der Technik H. Pottmann TU Wien SS 2007.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 I THE NATURAL PSEUDODISTANCE:
Local Symmetry - 2D Ribbons, SATs and Smoothed Local Symmetries Asaf Yaffe Image Processing Seminar, Haifa University, March 2005.
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,
Optimal Bandwidth Selection for MLS Surfaces
T. J. Peters Kerner Graphics Topologically Encoded Animation (TEA): History & Future.
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
T. J. Peters 2005 IBM Faculty Award with E. L. F. Moore & J. Bisceglio Computational Topology for Scientific Visualization and.
Optical Flow Estimation using Variational Techniques Darya Frolova.
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.
T. J. Peters, University of Connecticut K. Abe, J. Bisceglio, A. C. Russell Computational Topology on Approximated Manifolds.
Atul Singh Junior Undergraduate CSE, IIT Kanpur.  Dimension reduction is a technique which is used to represent a high dimensional data in a more compact.
T. J. Peters, University of Connecticut 3D Graphics Projected onto 2D (Don’t be Fooled!!!!)
Towards a Multiscale Figural Geometry Stephen Pizer Andrew Thall, Paul Yushkevich Medical Image Display & Analysis Group.
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.
NonLinear Dimensionality Reduction or Unfolding Manifolds Tennenbaum|Silva|Langford [Isomap] Roweis|Saul [Locally Linear Embedding] Presented by Vikas.
Tracking Point-Curve Critical Distances Xianming Chen, Elaine Cohen, Richard Riesenfeld School of Computing, University of Utah.
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.
Sanaa.Zangui, Modeling the near-field coupling of EMC filter components #Systems Simulation#TH-PM-2 1 MODELING THE NEAR-FIELD COUPLING OF EMC FILTER COMPONENTS.
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.
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
Topology By: Jarek Esswein.
Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
Intelligent Database Systems Lab Presenter : YAN-SHOU SIE Authors : MARCO PIASTRA NN Self-organizing adaptive map: Autonomous learning of curves.
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
JCT – uniqueness of the bounded component of the complement Suppose otherwise; then there are at least two disjoint bounded connected open regions in the.
1/66 Department of Computer Science and Engineering Tamal K. Dey The Ohio State University Delaunay Mesh Generation.
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.
JCT – boundaries of the components of the complement of a Jordan curve - I The boundary of a component of the complement of a Jordan curve is a subset.
Lecture 9 : Point Set Processing
Decimating Samples for Mesh Simplification
Equivalent source corresponding to radiated field of EMC filter components September 16, 2010 Sanâa ZANGUI
CSE 554 Lecture 2: Shape Analysis (Part I)
Image Representation and Description – Representation Schemes
Shape Dimension and Approximation from Samples
Topological Ordering Algorithm: Example
Viz, A Personal Overview Shapes vs Data
Max bigger small.
Topological Ordering Algorithm: Example
Presentation transcript:

T. J. Peters, University of Connecticut K. Abe, A. C. Russell, J. Bisceglio, E.. Moore, D. R. Ferguson, T. Sakkalis Topological Examples for Algorithmic Verification

Outline: Topology & Approximation Algorithms Applications

Unknot

Bad Approximation Why? Curvature? Separation?

Why Bad? Homeomorphic! Changes Knot Type Now has 4 Crossings

Good Approximation Homeomorphic vs. Ambient Isotopic (with compact support) 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

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

Large Data Set ! Partitioned Stanford Bunny

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