Decimating Samples for Mesh Simplification

Slides:



Advertisements
Similar presentations
Department of Computer Science and Engineering Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method Tamal K. DeyGang LiJian.
Advertisements

Section 4.1 – Vectors (in component form)
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
GRAPP, Lisbon, February 2009 University of Ioannina Skeleton-based Rigid Skinning for Character Animation Andreas Vasilakis and Ioannis Fudos Department.
Surface Reconstruction From Unorganized Point Sets
Proximity graphs: reconstruction of curves and surfaces
Sample Shuffling for Quality Hierarchic Surface Meshing.
Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.
Discrete Geometry Tutorial 2 1
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
Computing Medial Axis and Curve Skeleton from Voronoi Diagrams Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Joint.
Robust Repair of Polygonal Models Tao Ju Rice University.
Decomposing Polygon Meshes for Interactive Applications Li Xuetao Computer Graphics Laboratory.
Non-Manifold Medial Surface Reconstruction from Volumetric Data 12010/6/16 Takashi Michikawa and Hiromasa Suzuki Research Center for Advanced Science and.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
CENG 789 – Digital Geometry Processing 05- Smoothing and Remeshing
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Surface Reconstruction Some figures by Turk, Curless, Amenta, et al.
CS CS 175 – Week 3 Triangulating Point Clouds VD, DT, MA, MAT, Crust.
Surface Reconstruction with MLS Tobias Martin CS7960, Spring 2006, Feb 23.
Computing the Delaunay Triangulation By Nacha Chavez Math 870 Computational Geometry; Ch.9; de Berg, van Kreveld, Overmars, Schwarzkopf By Nacha Chavez.
Point Set Silhouettes via Local Reconstruction Matt Olson 1, Ramsay Dyer 2, Hao (Richard) Zhang 1, and Alla Sheffer
We build a surface between two complex closed spatial spline curves. Our algorithm allows the input curves to have differing degree, parameterization,
Finding generators for H1.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
10.1 Polar Coordinates. x y OriginPole Polar axis.
E.G.M. PetrakisBinary Image Processing1 Binary Image Analysis Segmentation produces homogenous regions –each region has uniform gray-level –each region.
Junjun Pan 1, Xiaosong Yang 1, Xin Xie 1, Philip Willis 2, Jian J Zhang 1
Gerald Dalley Signal Analysis and Machine Perception Laboratory The Ohio State University 07 Feb 2002 Linux Clustering Software + Surface Reconstruction.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
A New Voronoi-based Reconstruction Algorithm
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
With Tamal Dey, Qichao Que, Issam Safa, Lei Wang, Yusu Wang Computer science and Engineering The Ohio State University Xiaoyin Ge.
Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods IEEE Transactions on Visualization and Computer Graphics Authors: Carlos.
Objective To use angles of elevation and depression to solve problems.
Median, Angle bisector, Perpendicular bisector or Altitude Answer the following questions about the 4 parts of a triangle. The possible answers are listed.
Tamal K. Dey The Ohio State University Surface and Volume Meshing with Delaunay Refinement.
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Lecture 9 : Point Set Processing
CMPS 3130/6130 Computational Geometry Spring 2017
11.1 Polar Coordinates.
Variational Tetrahedral Meshing
Decimation Of Triangle Meshes
CS Computer Graphics II
Shape Dimension and Approximation from Samples
Angles and Their Measure
Angles and Their Measure
Domain-Modeling Techniques
Section 3.1 – Vectors in Component Form
Day 79 AGENDA: DG minutes.
February 1, 2018 Warm-up Find the surface area of a rectangular prism with a length of 5 meters, a width of 7 meters, and a height of 12 meters. Find.
Iris Authentication: System
Point-Cloud 3D Modeling.
Iso-Surface extraction from red and green samples on a regular lattice
Reference Angles.
Polar Coordinates 6.3.
Presentation transcript:

Decimating Samples for Mesh Simplification

Surface Reconstruction A sample and PL approximation

Sample Decimation Original 40K points = 0.33 12K points = 0.4

Local feature size and sampling Medial axis Local feature size f(p) -sampling   d(p)/f(p)

Voronoi structures

Cocones Space spanned by vectors making angle  /8 with horizontal Compute cocones Filter triangles whose duals intersect cocones Extract manifold

Cocones, radius and height cocones:C(p,,v) space by vectors making  /2 -  with a vector v. radius r(p): radius of cocone height h(p): min distance to the poles

Decimate

Cocone Lemma

Guarantees

Foot  0.4 2046 points Original 20021 points  0.33 2714 points

Foot  0.4 2046 points  0.33 2714 points  0.25 4116 points

Bunny  0.4 7K points  0.33 11K points Original 35K points

Bunny  0.4 7K points  0.33 11K points Original 35K points

Experimental Data

Conclusions Introduced a measure radius/height ratio for skininess of Voronoi cells We have used the radius/height ratio for sample decimation Used it for boundary detection (SOCG01) What about decimating supersize data (PVG01) Can we use it to eliminate noise? www.cis.ohio-state.edu/~tamaldey 543,652 points 143 -> 28 min 3.5 million points Unfin-> 198 min