Part Two Multiresolution Analysis of Arbitrary Meshes M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, W. Stuetzle SIGGRAPH 95.

Slides:



Advertisements
Similar presentations
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Advertisements

Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.
More Efficient Generation of Plane Triangulations Shin-ichi Nakano Takeaki Uno Gunma University National Institute of JAPAN Informatics, JAPAN 23/Sep/2003.
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Proximity graphs: reconstruction of curves and surfaces
Design and Analysis of Algorithms Single-source shortest paths, all-pairs shortest paths Haidong Xue Summer 2012, at GSU.
Ruslana Mys Delaunay Triangulation Delaunay Triangulation (DT)  Introduction  Delaunay-Voronoi based method  Algorithms to compute the convex hull 
By Groysman Maxim. Let S be a set of sites in the plane. Each point in the plane is influenced by each point of S. We would like to decompose the plane.
3/5/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Delaunay Triangulations II Carola Wenk Based on: Computational.
3D Surface Parameterization Olga Sorkine, May 2005.
Multiresolution Analysis of Arbitrary Meshes Matthias Eck joint with Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery and Werner Stuetzle Matthias.
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
Consistent Spherical Parameterization Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)
Spatial Information Systems (SIS)
Siggraph Course Mesh Parameterization: Theory and Practice Barycentric Mappings.
1cs542g-term Notes. 2 Meshing goals  Robust: doesn’t fail on reasonable geometry  Efficient: as few triangles as possible Easy to refine later.
Delaunay Triangulation Computational Geometry, WS 2006/07 Lecture 11 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
Spherical Parameterization and Remeshing Emil Praun, University of Utah Hugues Hoppe, Microsoft Research.
Bounded-distortion Piecewise Mesh Parameterization
CS CS 175 – Week 7 Parameterization Linear Methods.
Lapped Textures SIGGRAPH 2000 Emil Praun Adam Finkelstein Hugues Hoppe.
Image Quilting for Texture Synthesis and Transfer Alexei A. Efros1,2 William T. Freeman2.
Lecture 10 : Delaunay Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Overview Motivation. Triangulation of Planar Point Sets. Definition.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
Mesh Parameterization: Theory and Practice Barycentric Mappings.
Image Morphing : Rendering and Image Processing Alexei Efros.
1 Dr. Scott Schaefer Surface Parameterization. Parameterization and Texturing 2/30.
CS CS 175 – Week 7 Parameterization Boundary, Non-Linear, and Global Methods.
Mesh Parameterization: Theory and Practice Non-Planar Domains.
Computing the Delaunay Triangulation By Nacha Chavez Math 870 Computational Geometry; Ch.9; de Berg, van Kreveld, Overmars, Schwarzkopf By Nacha Chavez.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
1 University of Denver Department of Mathematics Department of Computer Science.
Image Morphing, Triangulation CSE399b, Spring 07 Computer Vision.
Visualization 2000 Tutorial Mesh-Based Methods for Multiresolution Representations Instructor: Ken Joy Center for Image Processing and Integrated Computing.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Consistent Parameterizations Arul Asirvatham Committee Members Emil Praun Hugues Hoppe Peter Shirley.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Parameterization.
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
Subdivision of Edge In a graph G, subdivision of an edge uv is the operation of replacing uv with a path u,w,v through a new vertex w.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
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 Mesh Parametrization and Its Applications 동의대학교 멀티미디어공학과 김형석 포항공과대학교 ( 이윤진, 이승용 )
Cindy Grimm Parameterization with Manifolds Cindy Grimm.
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
Geometry Images Xiang Gu Harvard University Steven J. Gortler Harvard university Hugues Hoppe Microsoft Research Some slides taken from Hugues Hoppe.
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,
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
Nonoverlap of the Star Unfolding Boris Aronov and Joseph O’Rourke, 1991 A Summary by Brendan Lucier, 2004.
Cindy Grimm Parameterizing N-holed Tori Cindy Grimm (Washington Univ. in St. Louis) John Hughes (Brown University)
Polygonal Simplification Techniques
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
1 Polygonal Techniques 이영건. 2 Introduction This chapter –Discuss a variety of problems that are encountered within polygonal data sets The.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
L8 - Delaunay triangulation L8 – Delaunay triangulation NGEN06(TEK230) – Algorithms in Geographical Information Systems.
Delaunay Triangulation on the GPU
UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.
Multimedia Programming 10: Image Morphing
Reverse Engineering of Point Clouds to Obtain Trimmed NURBS Lavanya Sita Tekumalla Advisor: Prof. Elaine Cohen School of Computing University of Utah Masters.
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
Common Intersection of Half-Planes in R 2 2 PROBLEM (Common Intersection of half- planes in R 2 ) Given n half-planes H 1, H 2,..., H n in R 2 compute.
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
1 Spherical manifolds for hierarchical surface modeling Cindy Grimm.
CMPS 3130/6130 Computational Geometry Spring 2017
Prof. Yu-Chee Tseng Department of Computer Science
Image Morphing © Zooface Many slides from Alexei Efros, Berkeley.
Mesh Parameterization: Theory and Practice
Subdivision Surfaces 고려대학교 컴퓨터 그래픽스 연구실 cgvr.korea.ac.kr.
Presentation transcript:

Part Two Multiresolution Analysis of Arbitrary Meshes M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, W. Stuetzle SIGGRAPH 95

Outline Partition using Voronoi diagram and Delaunay triangulationPartition using Voronoi diagram and Delaunay triangulation Parameterization using Harmonic MapsParameterization using Harmonic Maps Original meshBase complex

Applications Remeshing – subdivision connectivity Remeshing – subdivision connectivity Multiresolution analysis and editing Multiresolution analysis and editing Level-of-detail Level-of-detail

Harmonic Maps Defined for topological disksDefined for topological disks Minimize distortion in some senseMinimize distortion in some sense Do not guarantee an embedding (triangles flips may occur)Do not guarantee an embedding (triangles flips may occur) Require boundary conditionsRequire boundary conditions

Harmonic Maps - definition Input: mesh G with disk topology: N vertices {p 1, …, p n, …, p N } where p 1, …, p n are boundary vertices p 1, …, p n are boundary vertices Goal: Compute an embedding h of G h(i) = q i = (u i, v i ) i = 1, …, N

Harmonic Maps - definition The boundary vertices are mapped to a convex polygon in the parameter domainThe boundary vertices are mapped to a convex polygon in the parameter domain Treat each mesh edge as a spring, find mappings for inner vertices s.t. the energy of the spring system is minimalTreat each mesh edge as a spring, find mappings for inner vertices s.t. the energy of the spring system is minimal

Boundary conditions - corner vertices

Mapping inner vertices

Harmonic mapping Strives to preserve angles (conformal)Strives to preserve angles (conformal) We treat the mesh as a system ofWe treat the mesh as a system of springs. Define spring energy:Define spring energy: where v i are the flat positions, and the boundary vertices v 1, v 2, …, v n are constrained.

Energy minimization – least squares We want to find such flat positions that the energy is as small as possible.We want to find such flat positions that the energy is as small as possible. Solve the linear least squares problem!Solve the linear least squares problem! E harm is function of 2(N–n) variables

Energy minimization – least squares To find minimum:  E harm = 0To find minimum:  E harm = 0 Again, x 1,…., x n and y 1, …, y n are constrained.Again, x 1,…., x n and y 1, …, y n are constrained.

Energy minimization – least squares To find minimum:  E harm = 0To find minimum:  E harm = 0 Again, x 1,…., x n and y 1, …, y n are constrained.Again, x 1,…., x n and y 1, …, y n are constrained.

The spring constants k i,j The weights k i,j are chosen to minimize angles distortion:The weights k i,j are chosen to minimize angles distortion: –Look at the edge (i, j) in the 3D mesh –Set the weight k i,j = cot  + cot    i j 3D

Partition Compute Voronoi diagram on the mesh Compute Voronoi diagram on the mesh Compute induced Delaunay triangulation Compute induced Delaunay triangulation Construct the base mesh Construct the base mesh

Voronoi Diagram Given s faces (= sites) on the surface, expand patches (= Voronoi cells) around each one, using s-source Dijkstra algorithmGiven s faces (= sites) on the surface, expand patches (= Voronoi cells) around each one, using s-source Dijkstra algorithm How to choose the sites? How to choose the sites? – Each Voronoi cell must be a topologic disk – Pair of cells share at most one cut – No more than three cells share a vertex

Voronoi Diagram

Each cell is a topological disk

Voronoi Diagram Two cells share at most one boundary

Voronoi Diagram Two cells share at most one boundary

Voronoi Diagram At most three cells meet at a vertex

Choosing the sites – greedy approach Let S be the set of sites. Initiate S with a random triangle on the mesh.  Grow the cells around the sites of S until one of the conditions is violated.  Add the violating face to S and repeat the process.

Constructing Delaunay triangulation On the original mesh: connect by a path each pair of sites whose cells are adjacent On the original mesh: connect by a path each pair of sites whose cells are adjacent To construct the base mesh: connect each pair of adjacent sites by a straight line. To construct the base mesh: connect each pair of adjacent sites by a straight line.

Constructing Delaunay triangulation

Base mesh

Algorithm summary Partition the mesh (Delaunay triangulation)Partition the mesh (Delaunay triangulation) Construct the base meshConstruct the base mesh Parameterize each patch over the corresponding face of the base mesh. The mappings of adjacent patches agree on the boundary.Parameterize each patch over the corresponding face of the base mesh. The mappings of adjacent patches agree on the boundary. Continuous parameterization over the base mesh!

Results

34 min., 70,000 faces 162 faces 2,000 faces,  < 2.0 % 4,600 faces,  < 1.2 %

40 min., 100,000 faces 229 faces 2,000 faces,  < 2.0 % 4,700 faces,  < 1.5 %

346 min., 166,000 faces 132 faces 16,451 faces,  < 2.6 %

Texture mapping

Convex parameterization

Convex weights for inner vertices If the weights are convex, the solution is always valid (no self-intersections) [Floater 97]If the weights are convex, the solution is always valid (no self-intersections) [Floater 97] The cotangent weight in Harmonic Mapping can be negative  sometimes there are triangle flipsThe cotangent weight in Harmonic Mapping can be negative  sometimes there are triangle flips

End of Part Two