T. J. Peters, University of Connecticut Computer Science Mathematics www.cse.uconn.edu/~tpeters with K. Abe, J. Bisceglio, A. C. Russell, T. Sakkalis,

Slides:



Advertisements
Similar presentations
Department of Computer Science and Engineering Defining and Computing Curve-skeletons with Medial Geodesic Function Tamal K. Dey and Jian Sun The Ohio.
Advertisements

Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
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
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.
Consistent Mesh Parameterizations Peter Schröder Caltech Wim Sweldens Bell Labs Emil Praun Princeton.
Input Space versus Feature Space in Kernel- Based Methods Scholkopf, Mika, Burges, Knirsch, Muller, Ratsch, Smola presented by: Joe Drish Department of.
Proximity graphs: reconstruction of curves and surfaces
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
Discrete Geometry Tutorial 2 1
November 2005 Center for Computational Visualization Institute of Computational and Engineering Sciences Department of Computer Sciences University of.
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton.
T. J. Peters, University of Connecticut K. Abe, A. C. Russell, J. Bisceglio, E.. Moore, D. R. Ferguson, T. Sakkalis Topological.
Principal Component Analysis
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.
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
T. J. Peters Computational Topology : A Personal Overview.
T. J. Peters Kerner Graphics Topologically Encoded Animation (TEA): History & Future.
CS CS 175 – Week 3 Triangulating Point Clouds VD, DT, MA, MAT, Crust.
T. J. Peters 2005 IBM Faculty Award with E. L. F. Moore & J. Bisceglio Computational Topology for Scientific Visualization and.
Numerical geometry of non-rigid shapes
T. J. Peters, University of Connecticut with I-TANGO Team, ++ Computational Topology for Animation and Simulation.
1 Street Generation for City Modeling Xavier Décoret, François Sillion iMAGIS GRAVIR/IMAG - INRIA.
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!!!!)
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
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.
CAD’11, TaipeiDepartment of Engineering Design, IIT Madras M. Ramanathan Department of Engineering Design Indian Institute of Technology Madras.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
CSE 788 X.14 Topics in Computational Topology: --- An Algorithmic View Lecture 1: Introduction Instructor: Yusu Wang.
Evolving Curves/Surfaces for Geometric Reconstruction and Image Segmentation Huaiping Yang (Joint work with Bert Juettler) Johannes Kepler University of.
Dual Evolution for Geometric Reconstruction Huaiping Yang (FSP Project S09202) Johannes Kepler University of Linz 1 st FSP-Meeting in Graz, Nov ,
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
Clustering methods Course code: Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern Finland Joensuu,
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
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.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
Scalable and Fully Distributed Localization With Mere Connectivity.
Robustness in Numerical Computation I Root Finding Kwanghee Ko School of Mechatronics Gwnagju Institute of Science and Technology.
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.
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
CSE554SkeletonsSlide 1 CSE 554 Lecture 2: Shape Analysis (Part I) Fall 2015.
A New Voronoi-based Reconstruction Algorithm
Numerical Analysis. Numerical Analysis or Scientific Computing Concerned with design and analysis of algorithms for solving mathematical problems that.
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.
1 CS 430/585 Computer Graphics I 3D Modeling: Subdivision Surfaces & Solid Modeling Week 9, Lecture 17 David Breen, William Regli and Maxim Peysakhov Geometric.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Normal Equations The Orthogonality Principle Solution of the Normal Equations.
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
CSE 5559 Computational Topology: Theory, algorithms, and applications to data analysis Lecture 0: Introduction Instructor: Yusu Wang.
Fast Marching Algorithm & Minimal Paths Vida Movahedi Elder Lab, February 2010.
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
Lecture 9 : Point Set Processing
CSE 554 Lecture 2: Shape Analysis (Part I)
Semi-Supervised Clustering
Variational Tetrahedral Meshing
Viz, A Personal Overview Shapes vs Data
Max bigger small.
Presentation transcript:

T. J. Peters, University of Connecticut Computer Science Mathematics with K. Abe, J. Bisceglio, A. C. Russell, T. Sakkalis, D. R. Ferguson Computational Topology for Reconstruction of Manifolds With Boundary (Potential Applications to Prosthetic Design)

Problem in Approximation Input: Set of unorganized sample points Approximation of underlying manifold Want –Error bounds –Topological fidelity

Typical Point Cloud Data

Subproblem in Sampling Sampling density is important For error bounds and topology

Recent Overviews on Point Clouds Notices AMS,11/04, Discretizing Manifolds via Minimum Energy Points, ‘bagels with red seeds’ –Energy as a global criterion for shape (minimum separation of points, see examples later) –Leading to efficient numerical algorithms SIAM News: Point Clouds in Imaging, 9/04, report of symposium at Salt Lake City summarizing recent work of 4 primary speakers of ….

Recent Overviews on Point Clouds F. Menoti (UMn), compare with Gromov- Hausdorff metric, probabalistic D. Ringach (UCLA), neuroscience applications G. Carlsson (Stanford), algebraic topology for analysis in high dimensions for tractable algorithms D. Niyogi (UChi), pattern recognition

Seminal Paper Surface reconstruction from unorganized points, H. Hoppe, T. DeRose, et al., 26 (2), Siggraph, `92 Modified least squares method. Initial claim of topological correctness.

Modified Claim 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

Sampling Via Medial Axis Delauney Triangulation Use of Medial Axis to control sampling for every point x on F the distance from x to the nearest sampling point is at most 0.08 times the distance from x to MA(F)

Medial Axis Defined by H. Blum Biological Classification, skeleton of object Grassfire method

X

Formal Definition: Medial Axis The medial axis of F, MA(F), is the closure of the set of all points that have at least two distinct nearest points on S.

Sampling Via Medial Axis Nice: Adaptive for every point x on F the distance from x to the nearest sampling point is at most 0.08 times the distance from x to MA(F) Bad –Small change to surface can give large change to MA –Distance from surface to MA can be zero

Need for Positive Separation Differentiable surfaces,continuous 2 nd derivatives Shift from MA to –Curvature (local) –Separation (global)

Topological Equivalence Criterion? Alternative from knot theory KnotPlot Homeomorphism not strong enough

Unknot

Bad Approximation Why? Curvature? Separation?

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

Boundary or Not Surface theory – no boundary Curve theory – OK for both boundary & no boundary

Related Work D. Manocha (UNC), MA algorithms, exact arithmetic T. Dey, (OhSU), reconstruction with MA J. Damon (UNC, Math), skeletal alternatives K. Abe, J. Bisceglio, D. R. Ferguson, T. J. Peters, A. C. Russell, T. Sakkalis, for no boundary ….

Computational Topology Generalization D. Blackmore, sweeps, next week Different from H. Edelsbrunner emphasis on PL-approximations, some Morse theory. A. Zamorodian, Topology for Computing Computation Topology Workshop, Summer Topology Conference, July 14, ‘05, Denison. –Digital topology, domain theory –Generalizations, unifications?

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