Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi 2005 - Natal1 CHF: A Scalable Topological Data.

Slides:



Advertisements
Similar presentations
Planar Subdivision Induced by planar embedding of a graph. Connected if the underlying graph is. edge vertex hole in f face f disconnected subdivision.
Advertisements

Random Walks for Vector Field Denoising João Paixão, Marcos Lage, Fabiano Petronetto, Alex Laier, Sinésio Pesco, Geovan Tavares, Thomas Lewiner, Hélio.
Surface Simplification using Quadric Error Metrics Guowei Wu.
1/23 Vector field reconstruction from sparse samples with applications Marcos Lage, Fabiano Petronetto, Afonso Paiva, Hélio Lopes, Thomas Lewiner and Geovan.
Gopi -ICS280F02 - Slide 1 Characteristics of an Object.
Mathematics Combinatorics Graph Theory Topological Graph Theory David Craft.
Exploratory visualization based on multidimensional transfer functions and star coordinates Alex Laier Bordignon, Rener Castro, Hélio Lopes, Thomas Lewiner.
WSCG 2007 Memory Efficient and Robust Software Implementation of the Raycast Algorithm Aline Pina COPPE/UFRJ Rio de Janeiro - Brazil
Discrete Geometry Tutorial 2 1
3D Compression, SM’02 1Jarek Rossignac, GVU Center, Georgia Tech1: T-meshes Triangle meshes Jarek Rossignac GVU Center and College of Computing Georgia.
Mesh Representation, part II based on: Data Structures for Graphics, chapter 12 in Fundamentals of Computer Graphics, 3 rd ed. (Shirley & Marschner) Slides.
The Half-Edge Data Structure Computational Geometry, WS 2007/08 Lecture 3, Part III Prof. Dr. Thomas Ottmann Khaireel A. Mohamed Algorithmen & Datenstrukturen,
The Half-Edge Data Structure
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
Approximations by Smooth Transitions in Binary Space Partitions Marcos Lage, Alex Bordignon, Fabiano Petronetto, Álvaro Veiga, Geovan Tavares, Thomas Lewiner,
Topology Optimization with ASAND-CA 1/20 Topology Optimization of Truss Structures using Cellular Automata with Accelerated Simultaneous Analysis and Design.
Curvature Motion for Union of Balls Thomas Lewiner ♥♠, Cynthia Ferreira ♥, Marcos Craizer ♥ and Ralph Teixeira ♣ ♥ Department of Mathematics — PUC-Rio.
Point-set compression through BSP quantization A. Bordignon, T. Lewiner, H. Lopes, G. Tavares and R. Castro Departamento de Matemática – PUC-Rio.
Martin Isenburg University of North Carolina at Chapel Hill Triangle Fixer: Edge-based Connectivity Compression.
Face Fixer Compressing Polygon Meshes with Properties Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill.
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.
Robust Adaptive Meshes for Implicit Surfaces Afonso Paiva Hélio Lopes Thomas Lewiner Matmidia - Departament of Mathematics – PUC-Rio Luiz Henrique de Figueiredo.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
Normal based subdivision scheme for curve and surface design 杨勋年
Vieira et al. - Fast Stellar Mesh Simplification 1 Fast Stellar Mesh Simplification Antônio W. Vieira 1,2 Luiz Velho 3 Hélio Lopes 1 Geovan Tavares 1 Thomas.
Gambit Overview Ahmadi/Nazridoust ME 437/537/637.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Out-of-Core Compression for Gigantic Polygon Meshes Martin IsenburgStefan Gumhold University of North CarolinaWSI/GRIS at Chapel Hill Universität Tübingen.
Discrete Distortion for Surface Meshes Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept. of Computer Science, University of Genova, Italy.
Ziting (Vivien) Zhou1 Drawing Graphs By Computer Graph from
Informatik VIII Computer Graphics & Multimedia Martin Marinov and Leif Kobbelt Direct Quad-Dominated Anisotropic Remeshing Martin Marinov and Leif Kobbelt.
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 Background and definitions Cindy Grimm. 2 Siggraph 2005, 8/1/ Overview What does it mean to be.
Manuel Mesters - Subdivision Surfaces computer graphics & visualization Seminar Computer Graphics Geometric representation and processing: Subdivision.
7 th Annual Workshop on Charm++ and its Applications ParTopS: Compact Topological Framework for Parallel Fragmentation Simulations Rodrigo Espinha 1 Waldemar.
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.
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Poster Session 4 Geometry Processing.
1 Manifolds from meshes Cindy Grimm and John Hughes, “Modeling Surfaces of Arbitrary Topology using Manifolds”, Siggraph ’95 J. Cotrina Navau and N. Pla.
Triangular Mesh Decimation
Planar Subdivision Induced by planar embedding of a graph. Connected if the underlying graph is. edge vertex disconnected subdivision Complexity = #vertices.
Wiener Subdivision Presented by Koray KAVUKCUOGLU Geometric Modeling Spring 2004.
Solid Modeling Ref. Mantyla. Introduction Aim of modeling: The search of a media of communication.
1 Outline Previous work on geometric and solid modeling Multiresolution models based on tetrahedral meshes for volume data analysis Current work on non-manifold.
Mesh data structure & file format
CS418 Computer Graphics John C. Hart
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 7 Ravi Ramamoorthi
The InfoVis Toolkit Jean-Daniel Fekete INRIA Futurs/LRI, France
Solid Modeling 2002 A Multi-resolution Topological Representation for Non-manifold Meshes Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero.
Mesh Sekeltonization פרויקט סוף תואר איל רז מנחה – ג ' יהאד אל - סנה.
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.
Rendering Large Models (in real time)
Random volumes from matrices Based on the work with Masafumi Fukuma and Sotaro Sugishita (Kyoto Univ.) Naoya Umeda (Kyoto Univ.) [arXiv: ][JHEP.
Solid Modeling Prof. Lizhuang Ma Shanghai Jiao Tong University.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Advanced Computer Graphics (Spring 2013) Mesh representation, overview of mesh simplification Many slides courtesy Szymon Rusinkiewicz.
3D Object Representations. Introduction Line and circle and polygon algorithms- represented simple and smooth object. Some Natural object are neither.
Tutorial Mesh Processing Bruno Lévy INRIA - ALICE.
ELIANA CAICEDO STIVEN LOPEZ ANGELA CARDONA 10-2
Non-manifold Multiresolution Modeling (some preliminary results)
Boundary Representations and Topology
From Point Clouds To Trimmed NURBS
Efficient Edgebreaker for surfaces of arbitrary topology
MSRI – Manifolds Carlo H. Séquin.
Subdivision Surfaces 고려대학교 컴퓨터 그래픽스 연구실 cgvr.korea.ac.kr.
Prof. Lizhuang Ma Shanghai Jiao Tong University
Presentation transcript:

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal1 CHF: A Scalable Topological Data Structure for Tetrahedral Meshes Marcos Lage¹, Thomas Lewiner¹, ², Hélio Lopes¹, Luiz Velho³. ¹ PUC-Rio, Dept. de Matemática, Matmídia Project, Rio de Janeiro – Brazil. ² INRIA – Géométrica Project– Sophia Antipolis – France. ³ IMPA – Visgraf Project – Rio de Janeiro – Brazil.

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal2 Introduction Topological Data Structures:Topological Data Structures: MEMORY x PERFORMANCE Scalable ?Scalable ? New Scalable Data Structure for manifold Tetrahedral meshes

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal3 Previous Works For 3-Manifolds:For 3-Manifolds: For surfaces: For surfaces:

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal4 Contributions Manifold tetrahedral meshesManifold tetrahedral meshes Four levelsFour levels MEMORY x PERFORMANCE Generic containersGeneric containers Bitwise rulesBitwise rules

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal5 Level 0 – Overview Characteristic: Tetrahedral “soup” Application: Mesh Visualization

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal6 Level 0 – Basics

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal7 Level 0 – Rules Tetra(hf) := [hf/4]Tetra(hf) := [hf/4] = hf>>2 = hf>>2 Next hf (hf) := 4*Tetra(hf) + (hf+1)%4Next hf (hf) := 4*Tetra(hf) + (hf+1)%4 = hf&(~3) + (hf|1)&3 = hf&(~3) + (hf|1)&3 Mid hf (hf) := 4*Tetra(hf) + (hf+2)%4Mid hf (hf) := 4*Tetra(hf) + (hf+2)%4 = hf&(~3) + (hf|2)&3 = hf&(~3) + (hf|2)&3 Prev hf (hf) := 4*Tetra(hf) + (hf+3)%4Prev hf (hf) := 4*Tetra(hf) + (hf+3)%4 = hf&(~3) + (hf|3)&3 = hf&(~3) + (hf|3)&3

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal8 Level 0 – Half-Edges Next he (hf, he) := (hf, N[he%4][hf%4])Next he (hf, he) := (hf, N[he%4][hf%4]) Prev he (hf, he) := (hf, N[hf%4][he%4] )Prev he (hf, he) := (hf, N[hf%4][he%4] ) Mate he (hf, he) := (Prev he (hf, he), Next he (hf, he))Mate he (hf, he) := (Prev he (hf, he), Next he (hf, he))

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal9 Level 1 – Overview Characteristics: Neighborhood Information Application: TraversalTraversal SubdivisionSubdivision

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal10 Level 1 – Opposite Half-Face Opposites half-faces: – same vertices – opposite orientation

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal11 Level 1 – Opposite Container

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal12 Level 1 – Edge Star –Radial he (hf, he) := ( O[hf], next he (hf, he) ) + –Mate he (hf, he) := ( prev he (hf, he), next he (hf, he) )

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal13 Level 2 – Overview Characteristics: Explicit representation of the cells Applications: AttributesAttributes SimplificationSimplification

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal14 Level 2 – Extra Containers

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal15 Level 3 – Overview Characteristics: Explicit representation of the boundary surface Applications: TopologyTopology Direct DrawDirect Draw

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal16 Level 3 – Border CHE CHE: Compact half-edge Version of CHF of surfacesVersion of CHF of surfaces Four levels of structureFour levels of structure MEMORY x PERFORMANCE Generic containersGeneric containers Arithmetic rulesArithmetic rules

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal17 Operations – Vertex Star Level 0 Level 0 Level 1 Level 1 Levels 2 & 3 Levels 2 & 3 O(4*n tetra ) O(2*n tetra ) Θ(d°(v))

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal18 Operations – Edge Star Level 0 Level 0 Level 1 Level 1 Levels 2 & 3 Levels 2 & 3 O(4*n tetra ) O(2*n tetra ) Θ(d°(e))

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal19 Future Works Non-manifold meshes Vertex and edge singularities

Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal20 Thanks !!!