Download presentation

Presentation is loading. Please wait.

Published byPatricia Hansell Modified over 3 years ago

1
Alpha Shapes

2
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

3
Convexity A set S in Euclidean space is said to be convex if every straight line segment having its two end points in S lies entirely in S.

4
Convex Hulls The smallest convex set that contains the entire point set.

5
Triangulations

7
Voronoi Diagrams This set is a convex polyhedra since it is an intersection of half spaces. These polyhedra define a decomposition of R d. The voronoi complex V(P) of P is the collection of all voronoi objects. Delaunay complex is the dual of the voronoi complex.

8
Delaunay Triangulations

9
Voronoi Diagrams Post offices for the population in an area Subdivision of the plane into cells. Always Convex cells Curse of Dimension cells.

10
Lifting Map: Magic Map Map Convex Hull back -> Delaunay Map mapped back to lower dimension is the Voronoi diagram!!!

11
Other Definitions General Position of points in k-simplex, Simplicial Complex Flipping in 2D and 3D

12
k-simplex

13
Simplicial Complex Delaunay triangulations are simplicial complexes.

14
Flipping

15
Alpha Shapes The space generated by point pairs that can be touched by an empty disc of radius alpha.

16
Alpha Shapes Alpha Controls the desired level of detail.

17
Sample Outputs

18
Sample Output

19
Implementing Alpha Shapes Decide on Speed / Accuracy Trade off Exact Arithmetic : Keep Away SoS : Keep Away Simple Solution: Juggle Juggle and Juggle (To get to General Position)

20
Delaunay: How??? Lot of Algorithms available!!! Incremental Flipping? Divide and Conquer? Sweep? Randomized or Deterministic? Do I calculate Voronoi or Delaunay??.......... ( I got confused )

21
Predicates?? What are Predicates??? Why do I bother?? Which one do I pick? When do I use Exact Predicates? What else is available?

22
What Data Structure! What data structure is used to compute Delaunay? Which algorithm is easy to code? How do I implement the Alpha Shape in my code? Any example codes available to cheat? Creativity is the art of hiding Sources!

23
Theory Its not so bad…;) Lets get started, Simple things first Union of Balls If the facts don't fit the theory, change the facts. --Albert Einstein

24
That was simple! Weighted Voronoi: Seems not so tough yet

25
An example in the dual Courtesy Dey, Giesen and John 04. Edelsbrunner: Union of balls and alpha shapes are homotopy equivalent for all alpha.

26
What Next? The Dual Complex: Assuming General position, at most 3 Voronoi Cells meet at a point. For fixed weights, alpha, Its a alpha complex!

27
Example of Dynamic Balls!

28
Alpha Complex The subset of delaunay tesselation in d- dimensions that has simplices having Circumradius greater than Alpha. Its a Simplicial Complex all the way ( for a topologist )

29
Filter and Filtration A Filter!!!! (an order on the simplices) A Filtration??? (sequence of complexes)

30
Filteration??? Filteration = All Alpha Shapes!!! Alpha Shapes in 3D!! Covers, Nerves, Homotopy, Homology?? (Keep Away for now)

31
Alpha Shapes?? What the hell were Alpha Shapes??? As the Balls grow(Alpha becomes bigger) on the input point set, the dual marches thru the Filteration, defining a set of shapes. Thats it!! Wasnt it a cute idea for 1983!

32
So Far So Good! How do I calculate Alpha?? How do I decide the weights for a weighted Alpha shape? Is there an Alpha Shape that is Piecewise Linear 2-Manifold? Isnt the sampling criterion too strict?? Delaunay is Costly, Can we use Point Set Distribution information??

33
Future Work U want to work on Alpha Shapes?? (And get papers accepted too, Thats tough) Alpha shapes is old now, u could try something new! What else can we try? Try Energy Minimization, Optimization! Noise. With provability thrown in, That is still open.

34
Thats all Folks

Similar presentations

OK

Lecture 10 : Delaunay Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Overview Motivation. Triangulation of Planar Point Sets. Definition.

Lecture 10 : Delaunay Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Overview Motivation. Triangulation of Planar Point Sets. Definition.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on data collection methods in action Numeric display ppt on ipad Ppt on election in india 2012 Ppt on conservation of momentum worksheet Ppt on word association test marketing Ppt on facebook graph search Free download ppt on electricity for class 10 Ppt on space exploration Ppt on synthesis and degradation of purines and pyrimidines metabolism Download ppt on motion for class 9th