Alpha shapes Reporter: Lincong Fang 10th Jan, 2007.

Slides:



Advertisements
Similar presentations
Alpha Shapes. Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins.
Advertisements

Alpha Shapes Herbert Edelsbrunner Duke University, Computer Science (Raindrop) Geomagic LEIDEN 2006.
1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Surface Reconstruction From Unorganized Point Sets
Getting A Speeding Ticket. Mesh Generation 2D Point Set Delaunay Triangulation 3D Point Set Delaunay Tetrahedralization.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Homology Groups And Persistence Homology
Proximity graphs: reconstruction of curves and surfaces
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
Computational Geometry II Brian Chen Rice University Computer Science.
Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.
Ruslana Mys Delaunay Triangulation Delaunay Triangulation (DT)  Introduction  Delaunay-Voronoi based method  Algorithms to compute the convex hull 
What is the Region Occupied by a Set of Points? Antony Galton University of Exeter, UK Matt Duckham University of Melbourne, Australia.
3/5/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Delaunay Triangulations II Carola Wenk Based on: Computational.
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
3D spherical gridding based on equidistant, constant volume cells for FV/FD methods A new method using natural neighbor Voronoi cells distributed by spiral.
Computing Medial Axis and Curve Skeleton from Voronoi Diagrams Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Joint.
Delaunay Triangulation on the GPU Dan Maljovec. CPU Delaunay Triangulation Randomized Incremental Algorithm 1.Construct Bounding triangle 2.Choose point.
Algorithmic Classification of Resonant Orbits Using Persistent Homology in Poincaré Sections Thomas Coffee.
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Voronoi Diagrams and Delaunay Triangulations Generalized spaces and distances.
Surface Reconstruction Some figures by Turk, Curless, Amenta, et al.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
CS232.
Delaunay Triangulations for 3D Mesh Generation Shang-Hua Teng Department of Computer Science, UIUC Work with: Gary Miller, Dafna Talmor, Noel Walkington.
Voronoi diagrams of “nice” point sets Nina Amenta UC Davis “The World a Jigsaw”
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
CAD’12, CanadaDepartment of Engineering Design, IIT Madras P. Jiju and M. Ramanathan Department of Engineering Design Indian Institute of Technology Madras.
Numerical Analysis - Simulation -
Lee-Richards Approximation by Intra-Residue Reentrant Surface Exclusion Mario Rosa†, Paul Craig*†, Herbert J. Bernstein*‡
ADA: 14. Intro to CG1 Objective o give a non-technical overview of Computational geometry, concentrating on its main application areas Algorithm.
Surface Reconstruction Using RBF Reporter : Lincong Fang
On-line Space Sculpturing for 3D Shape Manipulation
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
PRE-TRIANGULATIONS Generalized Delaunay Triangulations and Flips Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology,
Reconstruction of Water-tight Surfaces through Delaunay Sculpting Jiju Peethambaran and Ramanathan Muthuganapathy Advanced Geometric Computing Lab, Department.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
23 rd August 2005BioGeometry – Duke University1 Packing Quality of Atoms in Proteins Madhuwanti Vaidya Advisor: Herbert Edelsbrunner.
Information Within the Interface Surface of a Protein-Protein Complex Yih-En Andrew Ban Duke University Biochemistry & Computer Science.
Shape Reconstruction From Planar Cross Sections CAI Hongjie | May 28, 2008.
Managing the Level of Detail in 3D Shape Reconstruction and Representation Leila De Floriani, Paola Magillo Department of Computer and Information Sciences.
Stabbing balls and simplifying proteins Ovidiu Daescu and Jun Luo Department of Computer Science University of Texas at Dallas Richardson, TX
3D Game Engine Design 1 3D Game Engine Design Ch D MAP LAB.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
1 Multi-resolution Tetrahedral Meshes Leila De Floriani Department of Computer and Information Sciences University of Genova, Genova (Italy)
A New Voronoi-based Reconstruction Algorithm
Kansas State University Department of Computing and Information Sciences Friday, July 13, 2001 Mantena V. Raju Department of Computing and Information.
Delaunay Triangulation on the GPU
How to tell the differences between a Cat and a Dog Masoud Alipour Ali Farhadi IPM – Scientific Computing Center Vision.
Meshless parameterization and surface reconstruction Reporter: Lincong Fang 16th May, 2007.
Algorithm for computing positive α-hull for a set of planar closed curves Vishwanath A. Venkataraman, Ramanathan Muthuganapathy Advanced Geometric Computing.
Detection of closed sharp edges in point clouds Speaker: Liuyu Time:
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
An algorithm for triangulating multiple 3D polygons M Zou, T Ju, N Carr Eurographics Symposium on Geometry Processing 2013 Who? Kundan Krishna 1 From?
Sajid Ghuffar 24.June  Introduction  Simplicial Complex  Boundary Operator  Homology  Triangulation  Persistent Homology 6/24/ Persistence.
|| Welcome to the Library Connect Event Zurich Dr. Oliver Renn, Chemistry | Biology | Pharmacy Information Center, ETH Zurich Elsevier Library.
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Coverage In Wireless Ad-Hoc Sensor Networks Shimon Tal Sion Cohen Instructor: Dr. Michael Segal.
Sept 25, 2013: Applicable Triangulations.
Robust and Fast Algorithm for a Circle Set Voronoi Diagram in a Plane
Sept 23, 2013: Image data Application.

Size Limited Bounding Polygons for Planar Point Sets
Meshing of 3-D Data Clouds for Object Description
Unstructured grid: an introduction
Presentation transcript:

Alpha shapes Reporter: Lincong Fang 10th Jan, 2007

What is the shape?

What are alpha shapes? Alpha Controls the desired level of detail.

What are alpha shapes?

Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins. For reverse engineering

Papers H. Edelsbrunner, D. G. Kirkpatrick and R.Seidel. On the shape of a set of points in the plane. IEEE ToIT H. Edelsbrunner and E. P. Mucke. Three dimensional alpha shapes, ToG Kaspar Fischer, Introduction to alpha shapes.

Authors Herbert Edelsbrunner: Chief technical consultant for Geomagic Arts & Science Professor of Computer Science at Duke University The only computer scientist ever to be awarded the prestigious National Science Foundation Alan T. Waterman Award

Authors David G. Kirkpatrick Professor, University of British Columbia Raimund Seidel Professor, Chair of Theoretical Computer Science, Saarland University Ernst P Mucke Univ. of Illinois, Urbana-Champaign Kaspar Fischer ETH Zurich, Switzerland

How to get alpha shapes The space generated by point pairs that can be touched by an empty disc of radius alpha.

General position No 4 points of S lie on a common plane No 5 points lie on a common sphere For any fixed alpha, the smallest sphere through any 2, 3 or 4 points of S has a radius different from alpha.

k-simplex

Simplicial Complex Delaunay triangulations are simplicial complexes.

Delaunay Triangulations

Alpha-ball and alpha exposed Alpha exposed Not alpha exposed

Definition of alpha shapes

Alpha shape

Observations

Definition of alpha complex

Alpha complex

Observations

Algorithm

Best alpha? Alpha Controls the desired level of detail.

Limitations Best alpha? Maybe there is no satisfying alpha.

Papers Baining Guo, Jai Menon, Brian Willette, Surface reconstruction using alpha shapes, Computer Graphics M. Teichmann and M. Capps., Surface reconstruction with anisotropic density-scaled alpha-shapes, IEEE Visualization ’ 98. Xiaolong Xu, Koichi Harada, Automatic surface reconstruction with alpha-shape method, Visual Computer 2003

Surface reconstruction using alpha shapes Baining Guo, Jai Menon, Brian Willette Computer Graphics 1997

Authors Baining Guo The research manager of the graphics group at Microsoft Research Asia. Jai Menon IBM Fellow Brian Willette Department of Computer Science, University of Colorado, USA

3D alpha shape

Outer shells of alpha shapes

Exterior face enumeration

Simplicial surface generation

Surface reconstruction with anisotropic density-scaled alpha- shapes M. Teichmann and M. Capps. IEEE Visualization ’ 98.

Authors Marek Teichmann Lab. for Computer Science, MIT Michael Capps President of Epic Games

Anisotropic alpha shapes

Density determination

Scaling algorithm Reduces the size of the alpha ball in areas where point density is high. Undesired effect of passing very large convex hull triangles.

Scaling algorithm Removes triangles which connect high-density and low density areas. Undesirable effects in non-nuiformly distributed point-sets

Automatic surface reconstruction with alpha-shape method Xiaolong Xu, Koichi Harada Visual Computer 2003

Authors Xiaolong Xu Ph.D candidate of Hiroshima, University, Japan Koichi Harada Professor for Hiroshima University

Density estimation

Scaling algorithm

Surface reconstruction

Weighted alpha shapes Herbert Edelsbrunner Technical report 1992

Weighted alpha shapes

Alpha exposed p q x

Weighted alpha shape

Benefit In biology and chemistry, modeling molecular structures. In reconstructing a surface from point data not uniform. Enforce certain edges or faces.

A surface reconstruction algorithm using weighted alpha shapes Si Hyung Park, Seoung Soo Lee, Jong Hwa Kim FSKD 2005

Authors Si Hyung Park Voronoi Diagram Research Center, Hanyang University, Korea Seoung Soo Lee, Jong Hwa Kim CAESIT, Konkuk University, Korea

Calculation of weights

Constant and weighted alpha

Peel off

The conformal alpha shape filtration Frederic Cazals, Joachim Giesen, Mark Pauly, Afra Zomorodian Visual Computer 2006

Authors Frederic Cazals Research Director, INRIA Sophia-Antipolis Joachim Giesen, Mark Pauly Computer Science, ETH Zurich, Switzerland Afra Zomorodian Assistant Professor in the Department of Computer Science at Dartmouth College

Conformal alpha shapes

Surface reconstruction