1. COMPUTATIONAL GEOMETRY INTRODUCTION AND CONVEX HULLS ZAHRA NILFOROUSHAN ELECTRICAL & COMPUTER ENGINEERING DEPARTMENT, FACULTY OF ENGINEERING, KHARAZMI UNIVERSITY, FALL 2016

2. COMPUTATIONAL GEOMETRY 8th Winter School On CG.,Feb. 24-29, 2016. Study of algorithms, data structures and computational complexity of computational problems in geometry. 2

3. LANDSCAPE OF CG Applications: Computer Graphics Robotics Vision GIS CAD / manufacturing VLSI (chip layout) Pattern Recognition Optimization Transportation Architecture Statistics Molecular modelling... Algorithmic Tools: general incremental divide-&-conquer space sweep topological sweep prune and search random sampling locus approach multidimensional search dynamization... Data Structures: general interval trees range trees segment trees priority search trees K-d trees fractional cascading persistent D.S.... 8th Winter School On CG.,Feb. 24-29, 2016. 3 Implementation Issues : Degeneracy (symbolic perturbation) Robustness (inexact arithmetic)...

4. Polygon Triangulation (Guarding an Art Gallery) Linear Programming (Manufacturing with Molds) CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 4

5. Orthogonal Range Searching (Querying a Database) Point Location (Knowing Where You Are) CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 5

6. Voronoi Diagrams (The Post Office Problem) Arrangements and Duality (Super sampling in Ray Tracing) CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 6

7. Delaunay Triangulations (Height Interpolation) More Geometric Data Structures (Windowing) CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 7

8. Binary Space Partitions (The Painter’s Algorithm) Robot Motion Planning (Getting Where You Want to Be) CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 8

9. Quad trees (Non-Uniform Mesh Generation) Visibility Graphs (Finding the Shortest Route) CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 9

10. Hidden Surface Removal (Multi-window user systems) VLSI Design (Checking no bugs in design) D A B C E D A B C E F F CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 10

11. Digitizing 3-Dimensional Objects (Scan the objects) CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 11

12. Bio Geometry (Protein folding) CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 12

13. Medial Axis & Skeleton CG OVERVIEW 8th Winter School On CG.,Feb. 24-29, 2016. 13

14. Computational Geometry Algorithms Library C++ library of efficient data structures and algorithms for many computational geometry problems supports round off-free exact computations 8th Winter School On CG.,Feb. 24-29, 2016. 14

15. CG HISTORY 8th Winter School On CG.,Feb. 24-29, 2016. 15

16. http://www.cccg.ca/ (The Canadian Conference on Computational Geometry ) http://www.cccg.ca/ http://www.eurocg.org/ (The European Workshop on Computational Geometry) http://www.eurocg.org/ http://cg.aut.ac.ir/acg/ (Laboratory of Algorithms and Computational Geometry (Room 213), Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran.) http://cg.aut.ac.ir/acg/ USEFUL LINKS 8th Winter School On CG.,Feb. 24-29, 2016. 16

17. CONVEX HULLS BASIC NOTIONS CLASSIC ALGORITHMS APPLICATIONS 8th Winter School On CG.,Feb. 24-29, 2016. 17

18. CONVEXITY 8th Winter School On CG.,Feb. 24-29, 2016. 18

19. CONVEX HULL 8th Winter School On CG.,Feb. 24-29, 2016. 19

20. CONVEX HULL Imagine that the points are nails sticking out of the plane, take an elastic rubber band, hold it around the nails, and let it go. It will snap around the nails, minimizing its length. The area enclosed by the rubber band is the convex hull of P. 8th Winter School On CG.,Feb. 24-29, 2016. 20

21. CONVEX HULL PROBLEM 8th Winter School On CG.,Feb. 24-29, 2016. The output has at least 4 and at most 2n coordinates, so it has size between O(1) and O(n) 21

22. 8th Winter School On CG.,Feb. 24-29, 2016. BRUTE FORCE ALGORITHM 22

23. 8th Winter School On CG.,Feb. 24-29, 2016. BRUTE FORCE ALGORITHM 23

24. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 24

25. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 25

26. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 26

27. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 27

28. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 28

29. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 29

30. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 30

31. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 31

32. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 32

33. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 33

34. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 34

35. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 35

36. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 36

37. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 37

38. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 38

39. INCREMENTAL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 39

40. GIFT-WRAPPING ALGORITHM 1.Start at lowest point 2.Rotate the line until we hit another point All other points will lie on one side of this line Look for the point that gives you the largest angle with the current line 3.Repeat 4.You’re done when you get back to the starting point 8th Winter School On CG.,Feb. 24-29, 2016. 40

41. Start with the lowest point (anchor point) 8th Winter School On CG.,Feb. 24-29, 2016. GRAHAM SCAN 41

42. Now, form a closed simple path traversing the points by increasing angle with respect to the anchor point 8th Winter School On CG.,Feb. 24-29, 2016. GRAHAM SCAN 42

43. GRAHAM SCAN  Remove points at concave angles (one at a time, backtracking one step when any point is removed).  Continue until you get all the way around. 8th Winter School On CG.,Feb. 24-29, 2016. 43

44. Stack S p7p6p5p4p3p2p1p7p6p5p4p3p2p1 p1p1 p2p2 p3p3 p4p4 p5p5 p6p6 p7p7 pipi pipi GRAHAM SCAN: A SNAPSHOT 8th Winter School On CG.,Feb. 24-29, 2016. 44

45. DIVIDE & CONQUER Preprocessing: sort the points by x- coordinate Divide the set of points into two sets A and B: A contains the left  n/2  points, B contains the right  n/2  points Recursively compute the convex hull of A Recursively compute the convex hull of B Merge the two convex hulls A B 8th Winter School On CG.,Feb. 24-29, 2016. 45

46. QUICK HULL ALGORITHM Form initial quadrilateral Q, with left, right, top, bottom. Discard points inside Q. 8th Winter School On CG.,Feb. 24-29, 2016. 46

47. QUICK HULL ALGORITHM For an edge ab, find the farthest outside point c. Discard points inside triangle abc. Split remaining points into “outside” points for ac and bc. 8th Winter School On CG.,Feb. 24-29, 2016. 47

48. QUICK HULL ALGORITHM 8th Winter School On CG.,Feb. 24-29, 2016. 48

49. SUMMARY 8th Winter School On CG.,Feb. 24-29, 2016. 49

50. Motion planning Find an optimal route that avoids obstacles for a robot obstacle start end 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS 50

51. 8th Winter School On CG.,Feb. 24-29, 2016. Bounding Box Obtain a closer bounding box in computer graphics Bounding boxes are used to an approximate location of an object in question and as a very simple descriptor of its shape. Convex hull can be a candidate for replacement of bounding boxes in these situations. SOME APPLICATIONS 51

52. 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS Visual Pattern Matching pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact. Compare two objects using their convex hulls 52

53. 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS Diameter Computation Find the diameter of a set of points, which is the pair of points a maximum distance apart The diameter will always be the distance between two points on the convex hull pjpj pipi CH(S) 53

54. 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS A B A B Linear Separability Separate two set of points by a line A & B are linearly separable  CH(A) & CH(B) have disjoint interiors 54

55. 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS Smallest enclosing circle Minimax Facility Location Problem Determine location X where a facility should be located so as to minimize the distance from X to its furthest customer 55

56. 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS Convex Layers Onion Layers of a set of points Registration and verification stages of two onions layers 56

57. 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS Shape Morph Find “an average” between two objects Feature matching! Smoothly turn a concave shape into a convex one before blending, and then the other way around when the blend is complete. 57

58. 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS 58

59. 8th Winter School On CG.,Feb. 24-29, 2016. SOME APPLICATIONS 59

60. THANKS FOR YOUR ATTENTION 8th Winter School On CG.,Feb. 24-29, 2016. 60