1 Outline Previous work on geometric and solid modeling Multiresolution models based on tetrahedral meshes for volume data analysis Current work on non-manifold.

Slides:



Advertisements
Similar presentations
Advanced Manufacturing Laboratory Department of Industrial Engineering Sharif University of Technology Session # 5.
Advertisements

Kick-off Meeting, July 28, 2008 ONR MURI: NexGeNetSci Distributed Coordination, Consensus, and Coverage in Networked Dynamic Systems Ali Jadbabaie Electrical.
Advanced Manufacturing Laboratory Department of Industrial Engineering Sharif University of Technology Session # 8.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
1 Enviromatics Spatial database systems Spatial database systems Вонр. проф. д-р Александар Маркоски Технички факултет – Битола 2008 год.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
Contour Tree and Small Seed Sets for Isosurface Traversal Marc van Kreveld Rene van Oostrum Chandrajit Bajaj Valerio Pascucci Daniel R. Schikore.
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 9 3D Modeling.
Polygonal Mesh – Data Structure and Smoothing
June 29, The difference between two feature models Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’07 Conference, Honolulu, Hawaii Faculty of Electrical.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.
Chapter 3 2D AND 3D SPATIAL DATA REPRESENTATIONS 김 정 준.
Introductory Notes on Geometric Aspects of Topology PART I: Experiments in Topology 1964 Stephen Barr (with some additional material from Elementary Topology.
12/06/00 Dinesh Manocha, COMP258 Solid Modeling CSG (Constructive Solid Geometry) Representations: A set theoretic Boolean expression of primitive solid.
Fast Isocontouring For Improved Interactivity Chandrajit L. Bajaj Valerio Pascucci Daniel R. Schikore.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Geometric Modeling and Computer Graphics GROUP
Graphs Rosen 8.1, 8.2. There Are Many Uses for Graphs! Networks Data organizations Scene graphs Geometric simplification Program structure and processes.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Compressing Multiresolution Triangle Meshes Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo Department of Computer and Information Sciences.
Multi-Scale Dual Morse Complexes for Representing Terrain Morphology E. Danovaro Free University of Bolzano, Italy L. De Floriani University of Genova,
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
SMI 2002 Multiresolution Tetrahedral Meshes: an Analysis and a Comparison Emanuele Danovaro, Leila De Floriani University of Genova, Genova (Italy) Michael.
COMPUTER AIDED DESIGN -(CAD)-3
Week 5 – MSE508/L Ileana Costea, Ph.D. Spring 2008 Solid Modeling/Data Exchanges Chapter 4 and part of Ch. 5 (pp ) (Chang textbook)
Kansas State University Department of Computing and Information Sciences CIS 736: Computer Graphics Wednesday, February 23, 2000 William H. Hsu Department.
1 Data Structures for Simplicial Multi-Complexes Leila De Floriani Paola Magillo Enrico Puppo University of Genova Genova (Italy)
Geometric Modeling using Polygonal Meshes Lecture 1: Introduction Hamid Laga Office: South.
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
Geometric Modeling and Computer Graphics GROUP DISI Department of Computer and Information Science University of Genova
Disediakan oleh Suriati bte Sadimon GMM, FSKSM, UTM, 2004 SOLID MODELLING.
General (point-set) topology Jundong Liu Ohio Univ.
1 Overview (Part 1) Background notions A reference framework for multiresolution meshes Classification of multiresolution meshes An introduction to LOD.
Combinatorial Algorithms Reference Text: Kreher and Stinson.
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.
Triangular Mesh Decimation
Random-Accessible Compressed Triangle Meshes Sung-eui Yoon Korea Advanced Institute of Sci. and Tech. (KAIST) Peter Lindstrom Lawrence Livermore National.
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
Managing the Level of Detail in 3D Shape Reconstruction and Representation Leila De Floriani, Paola Magillo Department of Computer and Information Sciences.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Solid Modeling. Solid Modeling - Polyhedron A polyhedron is a connected mesh of simple planar polygons that encloses a finite amount of space. A polyhedron.
Non-Manifold Multi-Tesselations From Meshes to Iconic Representations of Objects L. De Floriani, P. Magillo, E. Puppo, F. Morando DISI - University of.
Solid Modeling Ref. Mantyla. Introduction Aim of modeling: The search of a media of communication.
SpaDaGIS Efficiency Issues in Multi-resolution Terrain Modeling Leila De FlorianiPaola Magillo Leila De Floriani * Paola Magillo Department of Computer.
1 Multi-resolution Tetrahedral Meshes Leila De Floriani Department of Computer and Information Sciences University of Genova, Genova (Italy)
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.
Introductory Notes on Geometric Aspects of Topology PART I: Experiments in Topology 1964 Stephen Barr (with some additional material from Elementary Topology.
Greg Humphreys CS445: Intro Graphics University of Virginia, Fall 2003 Subdivision Surfaces Greg Humphreys University of Virginia CS 445, Fall 2003.
Solid Modeling 2002 A Multi-resolution Topological Representation for Non-manifold Meshes Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero.
Riccardo Fellegara University of Genova Genova, Italy
MINGLE Mid-Term Meeting (June 26, 2002)1 DISI - University of Genova Leila De Floriani MINGLE Mid-Term Meeting St. Malo, June 26, 2002.
1 k Jarek Rossignac,  2008 Topology  What is a polygon?  Set operations  Interior, boundary, exterior  Skin, Hair, Wound,
1 Overview (Part 1) Background notions A reference framework for multiresolution meshes Classification of multiresolution meshes An introduction to LOD.
Fifth International Conference on Curves and Surfaces Incremental Selective Refinement in Hierarchical Tetrahedral Meshes Leila De Floriani University.
Topology Preserving Edge Contraction Paper By Dr. Tamal Dey et al Presented by Ramakrishnan Kazhiyur-Mannar.
Delaunay Triangulations and Control-Volume Meshing Michael Murphy.
CS552: Computer Graphics Lecture 28: Solid Modeling.
Computer graphics 3D solid modeling.
SOLID MODELLING.
Non-manifold Multiresolution Modeling (some preliminary results)
Elements of Combinatorial Topology
Lecture 27: Solid Modeling
Discrete Surfaces and Manifolds: A Potential tool to Image Processing
Unstructured grid: an introduction
GRAPHS.
e2 e1 e5 e4 e3 v1 v2 v3 v4 f The dimension of f =
Prof. Lizhuang Ma Shanghai Jiao Tong University
Presentation transcript:

1 Outline Previous work on geometric and solid modeling Multiresolution models based on tetrahedral meshes for volume data analysis Current work on non-manifold multiresolution modeling

2 Non-Manifold Multiresolution Modeling A mathematical framework for describing non-manifold d- dimensional objects as assembly of simpler (quasi- manifold ) components. Topological data structures for non-manifold meshes in three (and higher) dimensions Multiresolution models for meshes with a non-manifold and non-regular domain for CAD applications: Data structures Query algorithms (extract topological data structures)

3 Non-Manifold Multiresolution Modeling: Why Non-Manifold? Need to represent and manipulate objects which combine wire-frames, surfaces, and solid parts: Boolean operators are not closed in the manifold domain. Sweeping, or offset operations may generate parts of different dimensionalities. Non-manifold topologies are required in different product development phases. Complex spatial objects described by meshes with a non- manifold and non-regular domain.

4 Non-Manifold Multiresolution Modeling A d-manifold M is a subset of the Euclidean space such that the neighborhood of any point of M is locally equivalent to a d- dimensional open ball. Spatial objects which do not fulfill the above condition are called non-manifolds. Spatial objects composed of parts of different dimensionalities are called non-regular.

5 Non-Manifold Multiresolution Modeling: Why Multiresolution? Availability of CAD models of large size Need for a multiresolution representation to be able to extract selectively refined meshes Our aim: multiresolution modeling not only for view-dependent rendering, but also for extracting adaptive meshes with a complete topological description (to support efficient mesh navigation though adjacencies)

6 Non-Manifold Multiresolution Modeling: Issues Non-manifolds are not well understood and classified from a mathematical point of view. Non-manifold cell complexes are difficult to encode and manipulate. Topological data structures have been proposed only for two- dimensional complexes, but do not scale well with the degree of “non-manifoldness” of the complex. Decomposing a non-manifold object into manifold components is possible only in two dimensions since the class of manifolds is not decidable in higher dimensions.

7 Non-Manifold Multiresolution Modeling A mathematical framework for describing non-manifold simplicial complexes in three and higher dimensions as assembly of simpler quasi-manifold components (DGCI,2002). An algorithm for decomposing a d-complex into a natural assembly of quasi-manifolds of dimension h<=d. A dimension-independent data structure for representing the decomposition (on-going work).

8 Pseudo-manifolds Let V be a finite set of vertices. An abstract simplicial complex on V is a subset  of the set of the non-empty part of V such that {v}   for every v  V, if   V is an element of , then every subset of  is also an element of . A d-complex in which all cells are maximal is called a regular complex. Let  be a (d-1)-cell of a regular d-complex.  is a manifold cell iff there exist at most two d-cells incident into  A regular complex which has only manifold cells is called a combinatorial pseudo-manifold.

9 Pseudo-manifolds A 2-pseudo-manifold An abstract simplicial complex which is not a pseudo-manifold A regular adjacent simplicial 1-complex is a regularly adjacent complex. A regular abstract simplicial complex is regularly adjacent iff the link of each of its vertices is a connected regularly adjacent (d-1)-complex.

10 Quasi-manifolds A complex is a quasi-manifold iff it is both a pseudo-manifold and a regularly adjacent complex. A 3-quasi-manifold (which is not a combinatorial 3-manifold) A 3-pseudo-manifold which is not regularly adjacent Quasi-manifolds  Manifolds in 2D

11 An example of a decomposition in the 2D case

12 Non-Manifold Multi-Triangulation (NMT) Extension of a Multi-Triangulation to deal with simplicial meshes having a non-manifold, non-regular domain Dimension-independent and application-independent definition of a modification An example of a modification

13 Non-Manifold Multi-Triangulation: An Example

14 Non-Manifold Multi-Triangulation (NMT) A compact data structure for a specific instance of the NMT in which each modification is a vertex expansion (vertex expansion = inverse of vertex-pair contraction) A topological data structure for non-regular, non-manifold 2D simplicial complexes, which scales to the manifold case with a small overhead Algorithms for performing vertex-pair contraction and vertex expansion (basic ingredients for performing selective refinement) on the topological representation of the complex.