Shape Space Exploration of Constrained Meshes Yongliang Yang, Yijun Yang, Helmut Pottmann, Niloy J. Mitra.

Slides:



Advertisements
Similar presentations
Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.
Advertisements

Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
Differential geometry I
Dimension Reduction by pre-image curve method Laniu S. B. Pope Feb. 24 th, 2005.
Surface Reconstruction From Unorganized Point Sets
Discrete Differential Geometry Planar Curves 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine, Eitan Grinspun.
Motion Planning for Point Robots CS 659 Kris Hauser.
Geometric Modeling Notes on Curve and Surface Continuity Parts of Mortenson, Farin, Angel, Hill and others.
An iterative surface model for timber construction SAH - April 2009 – Gilles Gouaty, Ivo Stotz, Eric Tosan, Yves Weinand SAH 2009 Laboratory of timber.
Discrete Geometry Tutorial 2 1
Trajectory Generation
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Research Report FWF S9206 Helmut Pottmann Geometric Modeling & Industrial Geometry.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
“Random Projections on Smooth Manifolds” -A short summary
Asst. Prof. Yusuf Sahillioğlu
Iso-charts: Stretch-driven Mesh Parameterization using Spectral Analysis Kun Zhou, John Snyder*, Baining Guo, Heung-Yeung Shum Microsoft Research Asia.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 4 Chapter 6: Arrangements Monday,
Correspondence & Symmetry
Curves Locus of a point moving with one degree of freedom
Niloy J. Mitra1, Natasha Gelfand1, Helmut Pottmann2, Leonidas J
Spectral Embedding Alexander Bronstein, Michael Bronstein
FiberMesh: Designing Freeform Surfaces with 3D Curves
Non-Euclidean Embedding
We build a surface between two complex closed spatial spline curves. Our algorithm allows the input curves to have differing degree, parameterization,
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.
The Planar-Reflective Symmetry Transform Princeton University.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
1 Numerical geometry of non-rigid shapes Nonrigid Correspondence & Calculus of Shapes Non-Rigid Correspondence and Calculus of Shapes Of bodies changed.
00/4/103DVIP-011 Part Three: Descriptions of 3-D Objects and Scenes.
Diffusion Maps and Spectral Clustering
SVD(Singular Value Decomposition) and Its Applications
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Abstraction of Man-Made Shapes Ravish Mehra 1,2, Qingnan Zhou 1, Jeremy Long 4, Alla Sheffer 1, Amy Gooch 4, Niloy J. Mitra 2,3 1 Univ. of British Columbia.
Laplacian Surface Editing
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 ,
Informatik VIII Computer Graphics & Multimedia Martin Marinov and Leif Kobbelt Direct Quad-Dominated Anisotropic Remeshing Martin Marinov and Leif Kobbelt.
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Niloy J. Mitra Leonidas J. Guibas Mark Pauly TU Vienna Stanford University ETH Zurich SIGGRAPH 2007.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
1 Manifolds from meshes Cindy Grimm and John Hughes, “Modeling Surfaces of Arbitrary Topology using Manifolds”, Siggraph ’95 J. Cotrina Navau and N. Pla.
Computer Vision Lab. SNU Young Ki Baik Nonlinear Dimensionality Reduction Approach (ISOMAP, LLE)
Shape Analysis and Deformation Igarashi Lab M2 Akira Ohgawara.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
Normal Curvature of Surface p  N T Local geometry at a surface point p:  surface normal N. The plane containing N and T cuts out a curve  on the surface.
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
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Ship Computer Aided Design MR 422. Geometry of Curves 1.Introduction 2.Mathematical Curve Definitions 3.Analytic Properties of Curves 4.Fairness of Curves.
Controlled-Distortion Constrained Global Parametrization
Geometric Modeling with Conical Meshes and Developable Surfaces SIGGRAPH 2006 Yang Liu, Helmut Pottmann, Johannes Wallner, Yong-Liang Yang and Wenping.
Energy-minimizing Curve Design Gang Xu Zhejiang University Ouyang Building, 20-December-2006.
Ship Computer Aided Design
3D Face Recognition Using Range Images Literature Survey Joonsoo Lee 3/10/05.
Geometric diffusions as a tool for harmonic analysis and structure definition of data By R. R. Coifman et al. The second-round discussion* on * The first-round.
Slide 1Lecture Fall ‘00 Surface Modeling Types: Polygon surfaces Curved surfaces Volumes Generating models: Interactive Procedural.
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
Unsupervised Riemannian Clustering of Probability Density Functions
Morphing and Shape Processing
Presentation transcript:

Shape Space Exploration of Constrained Meshes Yongliang Yang, Yijun Yang, Helmut Pottmann, Niloy J. Mitra

Shape Space Exploration of Constrained Meshes Meshes and Constraints Meshes as discrete geometry representations Constrained meshes for various applications

Yas Island Marina Hotel Abu Dhabi Architect: Asymptote Architecture Steel/glass construction: Waagner Biro

Shape Space Exploration of Constrained Meshes Constrained Mesh Example (1) Planar quad (PQ) meshes [Liu et al. 2006]

Shape Space Exploration of Constrained Meshes Constrained Mesh Example (2) Circular/conical meshes [Liu et al. 2006]

Shape Space Exploration of Constrained Meshes

Problem Statement Given: single input mesh with a set of non-linear constraints in terms of mesh vertices Goal:  explore neighboring meshes respecting the prescribed constraints  based on different application requirements, navigate only the desirable meshes according to given quality measures

Shape Space Exploration of Constrained Meshes Example input meshes found via exploration

Shape Space Exploration of Constrained Meshes Basic Idea Exploration of a high dimensional manifold  Meshes with same connectivity are mapped to points  Constrained meshes are mapped to points in a manifold M  Extract and explore the desirable parts of the manifold M

Shape Space Exploration of Constrained Meshes Map Mesh to Point The family of meshes with same combinatorics Mesh point Deformation field d applied to the current mesh x yields a new mesh x + d Distance measure

Shape Space Exploration of Constrained Meshes Constrained mesh manifold M:  represents all meshes satisfying the given constraints Individual constraint  defines a hypersurface in Constrained Mesh Manifold

Shape Space Exploration of Constrained Meshes Constrained Mesh Manifold Involving m constraints in M is the intersection of m hypersurfaces  dimension D-m (tangent space)  codimension m (normal space)

Shape Space Exploration of Constrained Meshes PQ mesh manifold M: Constraints (planarity per face)  each face (signed diagonal distance)  deviation from planarity  10mm allowance for 2m x 2m panels Example: PQ Mesh Manifold represents all PQ meshes

Shape Space Exploration of Constrained Meshes Tangent Space starting mesh Geometrically, intersection of the tangent hyperplanes of the constraint hypersurfaces

Shape Space Exploration of Constrained Meshes Walking on the Tangent Space

Shape Space Exploration of Constrained Meshes Better Approximation ? Better approximation - 2 nd order approximant curved path consider the curvature of the manifold

Shape Space Exploration of Constrained Meshes a simple idea m hypersurfaces: E i = 0 (i=1, 2,..., m) osculating paraboloid S i the intersection of all osculating paraboloids:  hard to compute  not easy to use for exploration

Shape Space Exploration of Constrained Meshes Compute Osculant Generalization of the osculating paraboloid of a hypersurface: osculant Has the following form: Second order contact with each of the constraint hypersurfaces

Shape Space Exploration of Constrained Meshes 2 nd order contact amounts to solving linear systems

Shape Space Exploration of Constrained Meshes Walking on the Osculant

Shape Space Exploration of Constrained Meshes Mesh Quality? Osculant respects only the constraints Quality measures based on application  Mesh fairness: important for applications like architecture Extract the useful part of the manifold

Shape Space Exploration of Constrained Meshes Extract the Good Regions Abstract aesthetics and other properties via functions F(x) defined on Restricting F(x) to the osculant S(u) yields an intrinsic Hessian of the function F

Shape Space Exploration of Constrained Meshes Commonly used Energies Fairness energies  smoothness of the poly-lines Orthogonality energy  generate large visible shape changes

Shape Space Exploration of Constrained Meshes Applications

Shape Space Exploration of Constrained Meshes Spectral Analysis Good (desirable) subspaces to explore 2D-slice of design space

Shape Space Exploration of Constrained Meshes 2D Subspace Exploration

Shape Space Exploration of Constrained Meshes Handle Driven Exploration

Shape Space Exploration of Constrained Meshes stiffness analysis

Shape Space Exploration of Constrained Meshes Circular Mesh Manifolds Circular Meshes (discrete principal curvature param.)  Each face has a circumcircle

Shape Space Exploration of Constrained Meshes moving out into space

Shape Space Exploration of Constrained Meshes

Combined Constraint Manifolds

Shape Space Exploration of Constrained Meshes Future Work multi-resolution framework osculant surfaces  update instead of recompute (quasi-Newton) other ways of exploration interesting curves and 2-surfaces in M, …. applications where handle-driven deformation doesn’t really work (because of low degrees of freedom): form-finding

Shape Space Exploration of Constrained Meshes Acknowledgements Bailin Deng, Michael Eigensatz, Mathias Höbinger, Alexander Schiftner, Heinz Schmiedhofer, Johannes Wallner Funding agencies: FWF, FFG Asymptote Architecture

Shape Space Exploration of Constrained Meshes What Do We Gain?