convex hull
play

Convex hull 1 - 1 Convex hull 1 - 2 Convex hull 1 - 3 Convex - PowerPoint PPT Presentation

Jan 13, 2024 •264 likes •1.41k views

Convex hull 1 - 1 Convex hull 1 - 2 Convex hull 1 - 3 Convex hull Definition, extremal point Jarvis algorithm Orientation predicate Buggy degenerate example Real RAM model and general position hypothesis Graham

  1. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w 2 = (24 , 24) w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) Do n = first in S ; For each w ∈ S u if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 3

  2. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w 2 = (24 , 24) w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u = v if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 4

  3. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w 2 = (24 , 24) w 3 = (30 , 30 . 000001) w w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u = v if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 5

  4. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w 2 = (24 , 24) w w 3 = (30 , 30 . 000001) n w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u = v if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 6

  5. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w w 1 = (12 , 12) w 2 = (24 , 24) w 3 = (30 , 30 . 000001) n w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u = v if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 7

  6. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w 2 = (24 , 24) w 3 = (30 , 30 . 000001) n w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u = v = w if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 8

  7. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w 2 = (24 , 24) v w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 9

  8. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w w 2 = (24 , 24) v w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 10

  9. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w w 2 = (24 , 24) v w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u if vwn positive then n = w ; v.next = n ; v = n ; Incoherence S = S \ { v } While v � = u 8 - 11

  10. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w w 1 = (12 , 12) w 2 = (24 , 24) v w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 12

  11. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) n w 1 = (12 , 12) w 2 = (24 , 24) v w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) Do n = first in S ; For each w ∈ S = w u if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 13

  12. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) v w 1 = (12 , 12) w 2 = (24 , 24) w w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 14

  13. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) v w 1 = (12 , 12) w 2 = (24 , 24) w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) n Do n = first in S ; For each w ∈ S u = w if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 15

  14. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w 2 = (24 , 24) w 3 = (30 , 30 . 000001) w 4 = (23 , 36) u = w 5 = (0 . 5000029 , 0 . 5000027) Do n = first in S ; For each w ∈ S u if vwn positive then n = w ; v.next = n ; v = n ; S = S \ { v } While v � = u 8 - 16

  15. Teaser robustness lecture Convex hull Buggy degenerate example (single precision) w 1 = (12 , 12) w 2 = (24 , 24) w 3 = (30 , 30 . 000001) w 4 = (23 , 36) w 5 = (0 . 5000029 , 0 . 5000027) u Result is really wrong 8 - 17

  16. Real RAM model and Convex hull general position hypothesis Real Random Access Memory model Assume exact computation on real numbers constant time for single operations: + , − , √ , sin . . . 9 - 1

  17. Real RAM model and Convex hull general position hypothesis Real Random Access Memory model Assume exact computation on real numbers constant time for single operations: + , − , √ , sin . . . General position hypotheses Predicate: Input �− → {− 1 , 0 , 1 } 9 - 2

  18. Real RAM model and Convex hull general position hypothesis Real Random Access Memory model Assume exact computation on real numbers constant time for single operations: + , − , √ , sin . . . General position hypotheses Predicate: Input �− → {− 1 , 0 , 1 } 2D convex hull: no three points colinear 9 - 3

  19. Real RAM model and Convex hull general position hypothesis Real Random Access Memory model Assume exact computation on real numbers constant time for single operations: + , − , √ , sin . . . General position hypotheses Predicate: Input �− → {− 1 , 0 , 1 } 2D convex hull: no three points colinear possibly: no 2 points with same x 9 - 4

  20. Convex hull Graham algorithm 10 - 1

  21. Convex hull Graham algorithm sort around a point (e.g. lowest point) 10 - 2

  22. Convex hull Graham algorithm sort around a point (e.g. lowest point) 10 - 3

  23. Convex hull Graham algorithm leftturn OK 10 - 4

  24. Convex hull Graham algorithm rightturn remove and go back 10 - 5

  25. Convex hull Graham algorithm leftturn OK 10 - 6

  26. Convex hull Graham algorithm leftturn OK 10 - 7

  27. Convex hull Graham algorithm leftturn OK 10 - 8

  28. Convex hull Graham algorithm rightturn remove and go back 10 - 9

  29. Convex hull Graham algorithm rightturn remove and go back 10 - 10

  30. Convex hull Graham algorithm leftturn OK 10 - 11

  31. Convex hull Graham algorithm leftturn OK 10 - 12

  32. Convex hull Graham algorithm rightturn remove and go back 10 - 13

  33. Convex hull Graham algorithm leftturn OK 10 - 14

  34. Convex hull Graham algorithm leftturn OK 10 - 15

  35. Convex hull Graham algorithm 10 - 16

  36. Complexity Convex hull Graham algorithm Input: point set S u lowest point of S ; sort S around u in a circular list including u ; v = u ; while v.next � = u if ( v, v.next, v.next.next ) ccw v = v.next ; else v.next = v.next.next ; v.next.previous = v ; if v � = u v = v.previous ; 11 - 1

  37. Complexity Convex hull Graham algorithm Input: point set S O ( n ) u lowest point of S ; sort S around u in a circular list including u ; v = u ; while v.next � = u if ( v, v.next, v.next.next ) ccw v = v.next ; else v.next = v.next.next ; v.next.previous = v ; if v � = u v = v.previous ; 11 - 2

  38. Complexity Convex hull Graham algorithm Input: point set S u lowest point of S ; O ( n log n ) sort S around u in a circular list including u ; v = u ; while v.next � = u if ( v, v.next, v.next.next ) ccw v = v.next ; else v.next = v.next.next ; v.next.previous = v ; if v � = u v = v.previous ; 11 - 3

  39. Complexity Convex hull Graham algorithm Input: point set S u lowest point of S ; sort S around u in a circular list including u ; v = u ; while v.next � = u if ( v, v.next, v.next.next ) ccw v = v.next ; else v.next = v.next.next ; v.next.previous = v ; if v � = u v = v.previous ; 11 - 4

  40. Complexity Convex hull Graham algorithm Input: point set S u lowest point of S ; sort S around u in a circular list including u ; v = u ; while v.next � = u if ( v, v.next, v.next.next ) ccw v = v.next ; else v.next = v.next.next ; v.next.previous = v ; if v � = u v = v.previous ; delete one point at most n times 11 - 5

  41. Complexity Convex hull Graham algorithm Input: point set S u lowest point of S ; sort S around u in a circular list including u ; v = u ; distance to u decreases at most n times while v.next � = u if ( v, v.next, v.next.next ) ccw v = v.next ; else v.next = v.next.next ; v.next.previous = v ; if v � = u v = v.previous ; delete one point at most n times 11 - 6

  42. Complexity Convex hull Graham algorithm Input: point set S u lowest point of S ; sort S around u in a circular list including u ; v = u ; distance to u decreases O ( n ) at most n times while v.next � = u if ( v, v.next, v.next.next ) ccw v = v.next ; else v.next = v.next.next ; v.next.previous = v ; if v � = u v = v.previous ; delete one point at most n times 11 - 7

  43. Complexity Convex hull Graham algorithm Input: point set S u lowest point of S ; sort S around u in a circular list including u ; v = u ; O ( n log n ) while v.next � = u if ( v, v.next, v.next.next ) ccw v = v.next ; else v.next = v.next.next ; v.next.previous = v ; if v � = u v = v.previous ; 11 - 8

  44. Convex hull Lower bound Problem lower bound is Ω( f ( n )) Iff there is NO algorithm solving all size n problems using less than Cf ( n ) operations ∀ n C constant independent of n 12

  45. Sorting Lower bound Input: n real (positive) numbers 13 - 1

  46. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation 13 - 2

  47. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation Monitoring execution 13 - 3

  48. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation Yes No Monitoring execution 13 - 4

  49. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation Yes No Monitoring execution 13 - 5

  50. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation Yes No Monitoring execution 13 - 6

  51. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation Yes No Monitoring execution ♯ leaves ≥ ♯ permutations 13 - 7

  52. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation Yes No Monitoring execution ♯ leaves ≥ ♯ permutations There are n ! permutations 13 - 8

  53. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation Yes No Monitoring execution ♯ leaves ≥ ♯ permutations There are n ! permutations Tree height is at least log 2 ♯ leaves 13 - 9

  54. Sorting Lower bound Input: n real (positive) numbers Output: sorting permutation Yes No Monitoring execution ♯ leaves ≥ ♯ permutations There are n ! permutations Tree height is at least log 2 ♯ leaves ♯ comparisons ≤ log 2 n ! ≃ n log 2 n 13 - 10

  55. Convex hull Lower bound Input: n 2D points (real coordinates) Output: list of points along the convex hull 14 - 1

  56. Convex hull Lower bound A stupid algorithm for sorting numbers 14 - 2

  57. Convex hull Lower bound project on parabola 14 - 3

  58. Convex hull Lower bound project on parabola compute convex hull 14 - 4

  59. Convex hull Lower bound project on parabola compute convex hull find lowest point 14 - 5

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Convex Hell 362 dnc CS 16: Convex Hull Whoops, I mean... Convex Hull Whats a Convex Hull?

Convex Hell 362 dnc CS 16: Convex Hull Whoops, I mean... Convex Hull Whats a Convex Hull?

CS 16: Convex Hull Welcome to... Convex Hell 362 dnc CS 16: Convex Hull Whoops, I mean... Convex Hull Whats a Convex Hull? 363 dnc CS 16: Convex Hull What is the Convex Hull? Let S be a set of points in the plane. Intuition: Imagine

720 views • 19 slides
Output of a convex-hull algorithm: a, b, c, g, j A&DS Lecture 16 2 Mary Cryan Polar Angles

Output of a convex-hull algorithm: a, b, c, g, j A&DS Lecture 16 2 Mary Cryan Polar Angles

The Convex Hull Definition 16.1 (1) A set C of points is convex if for all p, q C the whole line segment pq is contained in C . (2) The convex hull of a set S of points is the smallest convex set C that contains S . Observation 16.2 The convex

290 views • 14 slides
CS133 Computational Geometry Convex Hull 1 Convex Hull Given a set of n points, find the

CS133 Computational Geometry Convex Hull 1 Convex Hull Given a set of n points, find the

CS133 Computational Geometry Convex Hull 1 Convex Hull Given a set of n points, find the minimal convex polygon that contains all the points 2 Convex Hull Properties 3 Convex Hull Representation The convex hull is represented by all

1.07k views • 82 slides
CS133 Computational Geometry Convex Hull 4/12/2018 1 Convex Hull Given a set of n points,

CS133 Computational Geometry Convex Hull 4/12/2018 1 Convex Hull Given a set of n points,

CS133 Computational Geometry Convex Hull 4/12/2018 1 Convex Hull Given a set of n points, find the minimal convex polygon that contains all the points 4/12/2018 2 Convex Hull Properties 4/12/2018 3 Convex Hull Representation The

1.21k views • 81 slides
Convex hull: basic facts Convex hull: basic facts CG Lecture 1 CG Lecture 1 Problem : give a set

Convex hull: basic facts Convex hull: basic facts CG Lecture 1 CG Lecture 1 Problem : give a set

Convex hull: basic facts Convex hull: basic facts CG Lecture 1 CG Lecture 1 Problem : give a set of n points P in the plane, compute Convex Hull Algorithms its convex hull CH ( P ). Basic facts : 2D CH ( P ) is a convex polygon with

297 views • 7 slides
Computing Convex Hull (in 2D) Computational Geometry Convex hull Definition Geometry of

Computing Convex Hull (in 2D) Computational Geometry Convex hull Definition Geometry of

Yazd Univ. Computing Convex Hull (in 2D) Computational Geometry Convex hull Definition Geometry of problem 1st algorithm 2nd algorithm Proof of correctness 1393-1 Other algorithms Higher dimensions 1 / 20 Convex Set Definition: Yazd

531 views • 33 slides
Minimizing within convex bodies using a convex hull method Edouard Oudet Thomas

Minimizing within convex bodies using a convex hull method Edouard Oudet Thomas

Minimizing within convex bodies using a convex hull method Edouard Oudet Thomas Lachand-Robert 11th May 2004 Abstract We present numerical methods to solve optimization problems on the space of convex functions or among convex bodies.

343 views • 17 slides
The Convex Hull of a Parametrized Curve Cynthia Vinzant Department of Mathematics University of

The Convex Hull of a Parametrized Curve Cynthia Vinzant Department of Mathematics University of

The Convex Hull of a Parametrized Curve Cynthia Vinzant Department of Mathematics University of California, Berkeley SIAM - Convex Algebraic Geometry July 15, 2010 Cynthia Vinzant The Convex Hull of a Parametrized Curve Faces and Vertices of

350 views • 32 slides
Triangulation and Convex Hull 8th November 2018 Agenda 1. Triangulation. No book, the slides

Triangulation and Convex Hull 8th November 2018 Agenda 1. Triangulation. No book, the slides

Triangulation and Convex Hull 8th November 2018 Agenda 1. Triangulation. No book, the slides are the curriculum 2. Finding the convex hull. Textbook, 8.6.2 2 Triangulation and terrain models Here we have measured the elevation of a

857 views • 59 slides
The convex hull of a Banach-Saks set Pedro Tradacete Universidad Carlos III de Madrid Joint work

The convex hull of a Banach-Saks set Pedro Tradacete Universidad Carlos III de Madrid Joint work

The convex hull of a Banach-Saks set Pedro Tradacete Universidad Carlos III de Madrid Joint work with J. Lopez-Abad (CSIC) and C. Ruiz-Bermejo (UCM) Congreso de la RSME 22 de enero de 2013 P . Tradacete (UC3M) The convex hull of a

317 views • 12 slides
Manifolds with polynomially convex hull without analytic structure Alexander J. Izzo X C n

Manifolds with polynomially convex hull without analytic structure Alexander J. Izzo X C n

Manifolds with polynomially convex hull without analytic structure Alexander J. Izzo X C n compact Definition : The polynomially convex hull of X C n is X = { z C n : | p ( z ) | sup | p ( x ) | for every polynomial p } . x

578 views • 19 slides
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Introduction Parallel polytopes Convex hull of spheres Summary, extensions & open problems Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki

622 views • 59 slides
CPSC 490: Problem Solving in Computer Science 1 Convex sets A set S is convex x , y S

CPSC 490: Problem Solving in Computer Science 1 Convex sets A set S is convex x , y S

Lecture 16: Convex hull, binary/ternary search Henry Xia, Brandon Zhang based on CPSC 490 slides from 2014-2018 2019-03-14 University of British Columbia CPSC 490: Problem Solving in Computer Science 1 Convex sets A set S is convex x

768 views • 65 slides
MA/CSSE 473 Day 17 Divide-and-conquer Convex Hull Strassen's Algorithm: Matrix Multiplication

MA/CSSE 473 Day 17 Divide-and-conquer Convex Hull Strassen's Algorithm: Matrix Multiplication

MA/CSSE 473 Day 17 Divide-and-conquer Convex Hull Strassen's Algorithm: Matrix Multiplication MA/CSSE 473 Day 17 Student Questions Convex Hull (Divide and Conquer) Matrix Multiplication (Strassen) 1 Reminder: The Master Theorem

411 views • 6 slides
Non-Convex Hull Surfaces Gabriel Taubin Brown University

Non-Convex Hull Surfaces Gabriel Taubin Brown University

Non-Convex Hull Surfaces Gabriel Taubin Brown University Typical Surface Reconstruc3on Pipeline Oriented Reconstruc=on Surface Points Method Representa=on

696 views • 35 slides
MA/CSSE 473 Day 16 Answers to your questions Divide and Conquer Closest Points Convex Hull

MA/CSSE 473 Day 16 Answers to your questions Divide and Conquer Closest Points Convex Hull

MA/CSSE 473 Day 16 Answers to your questions Divide and Conquer Closest Points Convex Hull intro Exercise from last time Which permutation follows each of these in lexicographic order? 183647520 471638520 Try to write an algorithm

340 views • 8 slides
Re-Analysis of Radiation Epidemiologc Data 2018/10/1 ANS&HPS Joint Meeting

Re-Analysis of Radiation Epidemiologc Data 2018/10/1 ANS&HPS Joint Meeting

Re-Analysis of Radiation Epidemiologc Data 2018/10/1 ANS&HPS Joint Meeting Applicability of Radiation-Response Models to Low Dose Protection Standards Yutaka Hamaoka hamaoka@fbc.keio.ac.jp Faculty of Business and Commerce, Keio

391 views • 22 slides
The Incredible Shrinking Genome Utricularia gibba Enrique Ibarra-Laclette 2 , Eric Lyons 1 ,

The Incredible Shrinking Genome Utricularia gibba Enrique Ibarra-Laclette 2 , Eric Lyons 1 ,

The Incredible Shrinking Genome Utricularia gibba Enrique Ibarra-Laclette 2 , Eric Lyons 1 , Gustavo Hernandez 3 , Anahi Perez- Torres 2 , Lorenzo Carretero-Paulet 4 , Tien-Hao Chang 4 , Tianying Lan 4 , Andreanna Welch 4 , Maria Jazmin Abraham

391 views • 26 slides
Computational Learning Theory For which tasks is successful learning possible? Under what

Computational Learning Theory For which tasks is successful learning possible? Under what

Computational Learning Theory For which tasks is successful learning possible? Under what conditions is successful learning guaranteed? What is successful learning? Probably approximately correct (PAC) framework Bounds on number

422 views • 27 slides
CS-184: Computer Graphics Lecture #2: Color Prof. James OBrien University of California,

CS-184: Computer Graphics Lecture #2: Color Prof. James OBrien University of California,

CS-184: Computer Graphics Lecture #2: Color Prof. James OBrien University of California, Berkeley V2011-F-02-1.0 Slides revised using additional materials from Maneesh Agrawala Announcments Account sheets available after class Sign

482 views • 37 slides
Intro to ML March 10, 2020 Data Science CSCI 1951A Brown University Instructor: Ellie Pavlick

Intro to ML March 10, 2020 Data Science CSCI 1951A Brown University Instructor: Ellie Pavlick

Intro to ML March 10, 2020 Data Science CSCI 1951A Brown University Instructor: Ellie Pavlick HTAs: Josh Levin, Diane Mutako, Sol Zitter 1 Announcements This class is going viral! (Funny? No? Too soon?) Not officially, but starting to

1.45k views • 130 slides
Randomness in number theory Edgar Costa (MIT) November 29th, 2018 Colorado State University

Randomness in number theory Edgar Costa (MIT) November 29th, 2018 Colorado State University

Randomness in number theory Edgar Costa (MIT) November 29th, 2018 Colorado State University Slides available at edgarcosta.org under Research Randomness principle in number theory Number theoretic dichotomy [Sarnak] Given a problem, either

1.58k views • 86 slides
Bowing the violin A case study for auditory-motor pattern modeling in the context of music

Bowing the violin A case study for auditory-motor pattern modeling in the context of music

Bowing the violin A case study for auditory-motor pattern modeling in the context of music performance Quim Llimona Torras Advisor: Esteban Maestre Quim Llimona, 2014 Introduction | Experiment | Data | Features | Database | Analysis |

740 views • 70 slides
Its the Performance, Baby! Producing Motion Capture and Animation Tom Tolles & Jarrod

Its the Performance, Baby! Producing Motion Capture and Animation Tom Tolles & Jarrod

Its the Performance, Baby! Producing Motion Capture and Animation Tom Tolles & Jarrod Phillips House of Moves Motion Capture Studios Courtesy of Digital Domain 1 Overview Discuss Motion Capture Process Step One Planning

478 views • 28 slides

More recommend