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.

Slides:



Advertisements
Similar presentations
Multi-chart Geometry Images Pedro Sander Harvard Harvard Hugues Hoppe Microsoft Research Hugues Hoppe Microsoft Research Steven Gortler Harvard Harvard.
Advertisements

Image Segmentation with Level Sets Group reading
Isosurfaces Over Simplicial Partitions of Multiresolution Grids Josiah Manson and Scott Schaefer Texas A&M University.
1/50 Photo-Inspired Model-Driven 3D Object Modeling Kai Xu 1,2 Hanlin Zheng 3 Hao (Richard) Zhang 2 Daniel Cohen-Or 4 Ligang Liu 3 Yueshan Xiong 1 1 National.
1 Photometric Stereo Reconstruction Dr. Maria E. Angelopoulou.
LOGO 3D Reconstruction of Curved Objects from Single 2D Line Drawings CVPR'09 Reporter: PoHan 05/04/2010.
 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
GRAPP, Lisbon, February 2009 University of Ioannina Skeleton-based Rigid Skinning for Character Animation Andreas Vasilakis and Ioannis Fudos Department.
Least-squares Meshes Olga Sorkine and Daniel Cohen-Or Tel-Aviv University SMI 2004.
Extended Gaussian Images
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Dual Marching Cubes: An Overview
Shape Space Exploration of Constrained Meshes Yongliang Yang, Yijun Yang, Helmut Pottmann, Niloy J. Mitra.
Local or Global Minima: Flexible Dual-Front Active Contours Hua Li Anthony Yezzi.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
Mesh Simplification Global and Local Methods:
CENG 789 – Digital Geometry Processing 05- Smoothing and Remeshing
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
Polygonal Mesh – Data Structure and Smoothing
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
FiberMesh: Designing Freeform Surfaces with 3D Curves
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Point Set Silhouettes via Local Reconstruction Matt Olson 1, Ramsay Dyer 2, Hao (Richard) Zhang 1, and Alla Sheffer
We build a surface between two complex closed spatial spline curves. Our algorithm allows the input curves to have differing degree, parameterization,
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Adaptive Marching Cubes Renben Shu Chen Zhou Mohan S. Kankanhalli.
Curves and Surfaces (cont’) Amy Zhang. Conversion between Representations  Example: Convert a curve from a cubic B-spline curve to the Bézier form:
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.
Modeling. Topology Topology describes an object’s shape, number of spans, and degree. For polygon objects this includes vertex positions.
Ziting (Vivien) Zhou1 Drawing Graphs By Computer Graph from
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.
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
Interactive surface reconstruction on triangle meshes with subdivision surfaces Matthias Bein Fraunhofer-Institut für Graphische Datenverarbeitung IGD.
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
1 Adding charts anywhere Assume a cow is a sphere Cindy Grimm and John Hughes, “Parameterizing n-holed tori”, Mathematics of Surfaces X, 2003 Cindy Grimm,
Copyright © Curt Hill Visualization of 3D Worlds How are these images described?
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Non-Uniform Rational B-Splines NURBS. NURBS Surfaces NURBS surfaces are based on curves. The main advantage of using NURBS surfaces over polygons, is.
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.
Non-Manifold Multi-Tesselations From Meshes to Iconic Representations of Objects L. De Floriani, P. Magillo, E. Puppo, F. Morando DISI - University of.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
3D Object Morphing CS5245 Vision and Graphics for Special Effects.
A construction of rational manifold surfaces of arbitrary topology and smoothness from triangular meshes Presented by: LiuGang
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
Automatic Construction of Quad-Based Subdivision Surfaces using Fitmaps Daniele Panozzo, Enrico Puppo DISI - University of Genova, Italy Marco Tarini DICOM.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Recent Progress in Mesh Parameterization Speaker : ZhangLei.
Folding meshes: Hierarchical mesh segmentation based on planar symmetry Patricio Simari, Evangelos Kalogerakis, Karan Singh.
DPL3/10/2016 CS 551/651: Simplification Continued David Luebke
Introduction to 3D Solids and Solids of Revolution Some 3D shapes can be formed by revolving a 2D shape around a line (called the axis of revolution).
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Decimation of Triangle Meshes Paper by W.J.Schroeder et.al Presented by Guangfeng Ji.
1 Spherical manifolds for hierarchical surface modeling Cindy Grimm.
Mesh Modelling With Curve Analogies
Mesh Modelling With Curve Analogies
Variational Tetrahedral Meshing
Decimation Of Triangle Meshes
CS Computer Graphics II
Morphing and Shape Processing
Mesh Parameterization: Theory and Practice
Basic Assembly Constraints
Presentation transcript:

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 2 IIT Delhi 3 KAUST 4 Univ. of Victoria Abstraction of Man-Made Shapes

Human Perception

Abstraction of Man-Made Shapes Observation © Succession Picasso

Abstraction of Man-Made Shapes Observation o Man-Made objects dominated by flat/smooth faces. o Sharp creases define the shape. Cole et al. 2008

Abstraction of Man-Made Shapes Abstract Representation o Abstraction algorithm - curves as building blocks o Extract sparse network of curves + normals o Abstract shape - union of smooth patches

Abstraction of Man-Made Shapes o Curve based NPR Suggestive contours [DeCarlo et al. 2003] Apparent ridges [Judd et al. 2007] o Curve based surface modeling Wires [Singh et al. 1998] Fiber Mesh [Nealen et al. 2007] iWires [Gal et al. 2009] o Vector representation Diffusion Curves [Orzan et al. 2008] Related Works

Abstraction of Man-Made Shapes Abstraction Pipeline 1. Original model 2. Envelope3. Curve Network 4. Reconstruction result ReconstructionVectorization Envelope generation

Abstraction of Man-Made Shapes Challenge o Input contains multiple self-intersecting components. o Can even be a polygon soup.

Abstraction of Man-Made Shapes Envelope Generation o Envelope: A tight closed manifold approximation of the original surface.

Abstraction of Man-Made Shapes Envelope Generation: Initialization o Initial envelope: A manifold surface loosely follow inputs geometry.

Abstraction of Man-Made Shapes Envelope Generation: Iterative Fitting Preserves local details Pulls each vertex towards its original position Pulls each vertex towards its mapped position

Abstraction of Man-Made Shapes Envelope Generation

Abstraction of Man-Made Shapes Vectorization o Purpose: extract a vector representation o Encodes shape-defining features; concise & enables reconstruction Envelope Vector Representation

Abstraction of Man-Made Shapes Vectorization as Mesh Segmentation o Man-made shapes - union of smooth patches. o Vectorization as mesh segmentation problem. Segmentation – collection of charts Each chart should be smooth o Vector representation = boundary of segmentation + associated normals

Abstraction of Man-Made Shapes Initial Segmentation o Variational Shape Approximation [Cohen- Steiner et al. 2004]. Speed and simplicity Satisfies smoothness criteria o Topological Simplification Merging small charts Straightening boundaries [ Julius et al ]

Abstraction of Man-Made Shapes Iterative Improvement o Optimization for each chart Smooth surface smoothly varying normals Approximate the original shape Smooth boundary helps subsequent regularization phase

Abstraction of Man-Made Shapes Iterative Improvement o Normal solve trade-off between smoothness and original normals o Per-triangle solve vertex positions satisfying desired normals stay close to original positions o Global assembly reconcile different per-triangle vertex positions

Abstraction of Man-Made Shapes Iterative Improvement

Abstraction of Man-Made Shapes Regularization and Simplification o Regularity local : linear, circular, planar global : parallel, orthogonal, symmetric o Hierarchical simplification higher levels of abstraction simplify network regularize again

Abstraction of Man-Made Shapes Curve Extraction Vector representation of 3D Shapes

Abstraction of Man-Made Shapes Reconstruction o Reconstruct the abstract model Embed each boundary loop into a plane [Kruskal and Wish 1978] Triangulate the planar loops [Shewchuk 1996] Deform the planar patches using curves position and normal as constraints [Popa et al. 2006]

Abstraction of Man-Made Shapes Results

Abstraction of Man-Made Shapes Eiffel tower 15.6K triangles 2417 components 85 curves140 curves

Abstraction of Man-Made Shapes Empire state 16K triangles 17 components 38 curves152 curves

Abstraction of Man-Made Shapes Arc de Triomphe 13K triangles 8 components 139 curves193 curves

Abstraction of Man-Made Shapes Dome of the Rock 3.8K triangles 2 components 26 curves145 curves

Abstraction of Man-Made Shapes Limitations and Future Work o Thin long features that affect topology o Not well-known objects

Abstraction of Man-Made Shapes Summary o Algorithm for generating abstractions of 3D man- made models. o Simple yet robust mechanism for approximating polygon soup by a manifold surface. o Novel vector-based representation of 3D geometry.

Abstraction of Man-Made Shapes Video

Abstraction of Man-Made Shapes Acknowledgements Sponsored by Adobe Inc. MITACS NCE Microsoft Outstanding Young Faculty Fellowship NSERC Discover Program Thanks Benjamin Cecchetto Derek Bradley Karan Singh Tiberiu Popa Vladislav Kraevoy Xi Chen Anonymous reviewers

Abstraction of Man-Made Shapes

Iterative Improvement o Normal solve Normal should change smoothly within each chart Normal should remain close to its original direction

Abstraction of Man-Made Shapes Iterative Improvement o Per-triangle solve o Global Assembly (Similar to [Sumner and Popović 2004]) Each vertex should remain close its original position The triangle should satisfy the smoothed normal Boundary triangles only: Boundary edge should be close to the locally smoothed boundary edge.

Abstraction of Man-Made Shapes Extract network geometry o Global assembly (Similar to [Sumner and Popović 2004]) Each triangle should rotate as little as possible Each vertex remains close to its original position

Curve network Purpose of curve network Concise representation ( no redundancy ) Enable reconstruction Two types of curves Regular curve : Positions and normals along each side of curve Connectivity-only curve : removes ambiguity

Abstraction of Man-Made Shapes