1 Global Structure Optimization of Quadrilateral Meshes Published in Eurographics 2011 報告者 : 丁琨桓.

Slides:



Advertisements
Similar presentations
Steady-state heat conduction on triangulated planar domain May, 2002
Advertisements

The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Feature-Aligned T-Meshes
Social network partition Presenter: Xiaofei Cao Partick Berg.
Approximations of points and polygonal chains
Greed is good. (Some of the time)
Memory-Efficient Sliding Window Progressive Meshes Pavlo Turchyn University of Jyvaskyla.
Pattern-Based Quadrangulation for N-sided Patches
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Ruslana Mys Delaunay Triangulation Delaunay Triangulation (DT)  Introduction  Delaunay-Voronoi based method  Algorithms to compute the convex hull 
Mesh Simplification. Plan Introduction Mesh Simplifications Current Techniques The Projet Results.
Inter-Surface Mapping John Schreiner, Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)
Introduction Knowledge Engineering Session 2 Ronald Westra
Dual Marching Cubes: An Overview
An Incremental Approach to Feature Aligned Quad Dominant Remeshing ACM Symposium on Solid and Physical Modeling 2008 報告者 : 丁琨桓.
1 Terrain. Game Type Oriented Game Type Oriented Terrain Terrain –For visual ( 廣義的場景 ) »Ground / Building / Static models / Dynamic models –For terrain.
Chapter 3 The Greedy Method 3.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
CENG 789 – Digital Geometry Processing 05- Smoothing and Remeshing
1 Spanning Trees Lecture 20 CS2110 – Spring
CSE 780 Algorithms Advanced Algorithms Shortest path Shortest path tree Relaxation Bellman-Ford Alg.
Fractal Mountains, Splines, and Subdivision Surfaces Jordan Smith UC Berkeley CS184.
3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.
Aho-Corasick String Matching An Efficient String Matching.
Topology Optimization. Test_1_v030_l05_g2 Vertices: 762 Elements: 600 Uniform unstructured quad mesh (input) T-Mesh + T-Spline.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Introduction to Subdivision Surfaces. Subdivision Curves and Surfaces 4 Subdivision curves –The basic concepts of subdivision. 4 Subdivision surfaces.
SINGLE-SOURCE SHORTEST PATHS. Shortest Path Problems Directed weighted graph. Path length is sum of weights of edges on path. The vertex at which the.
All-Hex Meshing using Singularity-Restricted Field Yufei Li 1, Yang Liu 2, Weiwei Xu 2, Wenping Wang 1, Baining Guo 2 1. The University of Hong Kong 2.
1 Three dimensional mosaics with variable- sized tiles Visual Comput 2008 報告者 : 丁琨桓.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
© The McGraw-Hill Companies, Inc., Chapter 3 The Greedy Method.
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
1 3D virtual mosaics: Opus Palladium and mixed styles Visual Comput 2009 報告者 : 丁琨桓.
Geometry Images Xiang Gu Harvard University Steven J. Gortler Harvard university Hugues Hoppe Microsoft Research Some slides taken from Hugues Hoppe.
Sequences.  1. Starting at the beginning object, count until you come to the requested position (term)  Ex-  What is the 11 th shape?
Mesh Data Structure. Meshes Boundary edge: adjacent to 1 face Regular edge: adjacent to 2 faces Singular edge: adjacent to >2 faces Mesh: straight-line.
Prims’ spanning tree algorithm Given: connected graph (V, E) (sets of vertices and edges) V1= {an arbitrary node of V}; E1= {}; //inv: (V1, E1) is a tree,
1 Triangle Surfaces with Discrete Equivalence Classes Published in SIGGRAPH 2010 報告者 : 丁琨桓.
Part 1: Biological Networks 1.Protein-protein interaction networks 2.Regulatory networks 3.Expression networks 4.Metabolic networks 5.… more biological.
Is this a square or a pentagon? It is a square.
1 Surface mosaics Visual Comput 2006 報告者 : 丁琨桓. 2 Introduction Mosaics are an art form with a long history: many examples are known from Graeco- Roman.
1 Polygonal Techniques 이영건. 2 Introduction This chapter –Discuss a variety of problems that are encountered within polygonal data sets The.
Subdivision Surfaces Ref: Subdivision Surfaces in Character Animation, DeRose et. al, SIGGRAPH98.
Image Emotional Semantic Query Based On Color Semantic Description Wei-Ning Wang, Ying-Lin Yu Department of Electronic and Information Engineering, South.
Automatic Construction of Quad-Based Subdivision Surfaces using Fitmaps Daniele Panozzo, Enrico Puppo DISI - University of Genova, Italy Marco Tarini DICOM.
= 5 = 2 = 4 = 3 How could I make 13 from these shapes? How could I make 19 from these shapes? STARTER.
Introduction to Algorithms All-Pairs Shortest Paths My T. UF.
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 10, 2015 TRIANGLE MESHES 3D MESHES MESH OPERATIONS.
1 L p Centroidal Voronoi Tessellation and its Applications Published in Siggraph 2010 報告者 : 丁琨桓.
Polygons A polygon is a plane shape with straight sides.
Decimation of Triangle Meshes Paper by W.J.Schroeder et.al Presented by Guangfeng Ji.
Clothing Manipulation Takeo Igarashi John F.Hughes Computer Science Department University of Tokyo Computer Science Department Brown University.

Types of Polygons Polygon- a flat closed figure made of straight line segments Circle the figures that are polygons. Cross out the figures 
that are.
Properties of Geometric Shapes
Hamiltonian cycle part
Spanning Trees Discrete Mathematics.
From Point Clouds To Trimmed NURBS
Grimm and Hughes Input: arbitrary mesh
Search Related Algorithms
Minimum spanning trees
Minimum spanning trees
Which One Doesn’t Belong?
Warm Up – Tuesday Find the critical times for each vertex.
Spanning Trees Lecture 20 CS2110 – Spring 2015.
Closures of Relations Epp, section 10.1,10.2 CS 202.
Autonomously designed free-form 2D DNA origami
Presentation transcript:

1 Global Structure Optimization of Quadrilateral Meshes Published in Eurographics 2011 報告者 : 丁琨桓

2 Introduction this paper proposing an algorithm that takes an automatically generated quad mesh as input and converts it into a quad mesh with improved global structure Optimization : NURBS fitting ab

3 Introduction NURBS

4 Related Work Quad mesh decimation [DSSC08] Quadrilateral mesh simplification Poly-Chord 、 Quadrilateral Collapse originalsimplified

5 Related Work Quad-remeshing [BZK09] Mixed-Integer Quadrangulation

6 Algorithm Input mesh Base complex Search q-helices GP-operator Smoothing

7 Definition A vertex is called regular if it has valence 4 otherwise it is a singular vertex. An important property of the dual of a quadrilateral mesh is that all vertices are regular (valence 4).

8 Base Complex The base complex is the union of all parametric lines which start and end at singular vertices.

9 Algorithm the input mesh with a fine base-complex

10 Grid-Preserving Operators dual half-edge shift leftcollapseshift right

11 Grid-Preserving Operators The most important property of a GP-operator is that it does not introduce new singularities or non-quadrilateral elements.

12 Grid-Preserving Operators Quad loop the triangle and the pentagon will cancel out at the last dual half-edge to the state at the first dual half-edge.

13 Quad loop Creating three vertices for each dual half edge, the different states shift left (red), collapse (yellow) and shift right (green).

14 Quad loop Singular Breadth-first search all possible paths generated by the state- machine with increasing length until the shortest cycle is found. Exponential time

15 q-helices topological helices in quadrilateral meshes, which call q-helices

16 q-helices pitch 1 pitch =1 pitch >1

17 Algorithm Two q-helices (blue and yellow curve) are identified Base complexq-helices

18 Algorithm belonging to the blue helix is extended to a GP-operator q-helicesQuad loop

19 Algorithm mesh after applying all GP-operations tangential smoothing improves the per element quality apply GP-operationssmoothing

20 Result Base complex Optimization

21 Result Base complexOptimization

22 Result

23 Result # Hel : the number of helices # F : the number of quadrilaterals of the mesh # BC : he number of quadrilaterals of the base-complex

24 Result a bc Grid-Preserving Operators 使用時機