An Out-of-core Algorithm for Isosurface Topology Simplification Zoë Wood Hughes Hoppe Mathieu Desbrun Peter Schröder.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Coloring Warm-Up. A graph is 2-colorable iff it has no odd length cycles 1: If G has an odd-length cycle then G is not 2- colorable Proof: Let v 0, …,
Polygon Rasterization
Multilevel Streaming for Out-of-Core Surface Reconstruction
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Consistent Mesh Parameterizations Peter Schröder Caltech Wim Sweldens Bell Labs Emil Praun Princeton.
Computational Topology for Computer Graphics Klein bottle.
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
Robust Repair of Polygonal Models Tao Ju Rice University.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
The Ball Pivoting Algorithm
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
Asst. Prof. Yusuf Sahillioğlu
lecture 4 : Isosurface Extraction
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Cutting a surface into a Disk Jie Gao Nov. 27, 2002.
Topology Matching For Fully Automatic Similarity Matching of 3D Shapes Masaki Hilaga Yoshihisa Shinagawa Taku Kohmura Tosiyasu L. Kunii.
Modelling. Outline  Modelling methods  Editing models – adding detail  Polygonal models  Representing curves  Patched surfaces.
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
Aho-Corasick String Matching An Efficient String Matching.
Shortest Path Algorithm By Weston Vu CS 146. What is Shortest Paths? Shortest Paths is a part of the graph algorithm. It is used to calculate the shortest.
We build a surface between two complex closed spatial spline curves. Our algorithm allows the input curves to have differing degree, parameterization,
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
Consistent Parameterizations Arul Asirvatham Committee Members Emil Praun Hugues Hoppe Peter Shirley.
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
ECS 289L A Survey of Mesh-Based Multiresolution Representations Ken Joy Center for Image Processing and Integrated Computing Computer Science Department.
Department of Computer Science and Engineering Computing handles and tunnels in 3D models Tamal K. Dey Joint work: Kuiyu Li, Jian Sun, D. Cohen-Steiner.
Discrete Math Round, Round, Get Around… I Get Around Mathematics of Getting Around.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
A lightweight approach to repairing digitized polygon meshes Marco Attene IMATI-GE / CNR 2010 Presented by Naitsat Alexander.
Graph Algorithms Mathematical Structures for Computer Science Chapter 6 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesGraph Algorithms.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Motion Planning in Games Mark Overmars Utrecht University.
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
Spatial Databases - Introduction Spring, 2015 Ki-Joune Li.
Shape Reconstruction From Planar Cross Sections CAI Hongjie | May 28, 2008.
Overview of Propagating Interfaces Donald Tanguay October 30, 2002.
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.
Chapter 10 Graph Theory Eulerian Cycle and the property of graph theory 10.3 The important property of graph theory and its representation 10.4.
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
Computer Graphics Filling. Filling Polygons So we can figure out how to draw lines and circles How do we go about drawing polygons? We use an incremental.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Graph Theory. undirected graph node: a, b, c, d, e, f edge: (a, b), (a, c), (b, c), (b, e), (c, d), (c, f), (d, e), (d, f), (e, f) subgraph.
Graph problems Prof. Ramin Zabih
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
An Approach to Automated Decomposition of Volumetric Mesh Chuhua Xian, Shuming Gao and Tianming Zhang Zhejiang University.
3-D Mesh Morphing By Newton Der.
Distance Vector and Link State Routing Pragyaditya Das.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Week 11 - Wednesday.  What did we talk about last time?  Exam 2  And before that:  Graph representations  Depth first search.
Oct 30, 2005Sylvain Jaume1 Open Topology: A Toolkit for Brain Isosurface Correction Sylvain JAUME (1), Patrice RONDAO (2), Benoit MACQ (2) (1) Kitware.

Planarity Testing.
Domain-Modeling Techniques
Can you draw this picture without lifting up your pen/pencil?
Spanning Trees.
Performance Comparison of Tarry and Awerbuch Algorithms
A Volumetric Method for Building Complex Models from Range Images
Minimum Spanning Tree Algorithms
Algorithms for Budget-Constrained Survivable Topology Design
Lecture 11 CSE 331 Sep 19, 2014.
Simple Graphs: Connectedness, Trees
Warm Up – Tuesday Find the critical times for each vertex.
Some Graph Algorithms.
Presentation transcript:

An Out-of-core Algorithm for Isosurface Topology Simplification Zoë Wood Hughes Hoppe Mathieu Desbrun Peter Schröder

Problem Discretely represented surface Reconstruction as “isosurface” f (x, y, z) = 0 NOISY NEARLY INVISIBLE HANDLES Bad for simplification, parameterization, etc.

Buddha Handle

The Challenge Handles we wantHandles we don’t want SEPARATE from

Solution Attempt 1.Find all handles 2.Calculate their sizes 3.Remove the “small enough” ones

The Input Isosurface computation Volumetric data in slices Isosurface as polygon mesh

Finding Handles Isosurface Reeb graph HandlesCycles in Reeb graph

Reeb Graphs Contours Ribbons (parts of polygon mesh inside slice) { Slice Height function f(x, y, z) CONNECTED COMPONENTS

Constructing Reeb Graphs REEB GRAPH A node for each contour A node for each ribbon An edge between each ribbon and its contours

Finding Cycles in Reeb Graphs When adding ribbon r: For each pair of contours (c 1, c 2 ) adjacent to r Report (c 2, r) + (r, c 1 ) + (shortest path c 1 → c 2 ) as cycle Intra-Ribbon Handles For each i: if Euler characteristic of slice i ≠ # cycles in Reeb graph, then slice i – 1 had a handle in it

Measuring Handle Size Fill in handle?Or pinch it open? Both contract loop to a point! 1. Find Reeb loop 2. Find cross loop 3. Size = length of smaller loop Non-separating

Removing Handles Use the same loop we used to measure handle size! Before removing cross loop After removing cross loop

Results Still hard to tell which handles are “small enough”. Dragon has one handle of length 46, causing this method to fail. Handles inside handles slow down this method (Reeb graphs are recomputed locally to check for this). Uncontrollable jumps in loop sizes after a collapse. Also, very inefficient if orientation of surface is bad.

Conclusion PROBLEM Removing undesired handles SOLUTION ATTEMPT 1.Find handles 2.Calculate their sizes 3.Remove small enough ones RESULTS Doesn’t work if there is even one large extraneous handle Can be very inefficient FUTURE DIRECTIONS 1.Reeb graphs for arbitrary meshes, avoiding self-intersections 2.Smoothing after removing large handles 3.New ways of measuring handle size 4.Varying isosurface handle removal: preprocess volume [Zomorodian 2001]