intersection graphs of maximal convex sub polygons of k
play

Intersection Graphs of Maximal Convex Sub-Polygons of k -Lizards - PowerPoint PPT Presentation

Feb 04, 2024 •131 likes •1.5k views

Geometric Representations of Graphs Intersection Graphs of Maximal Convex Sub-Polygons of k -Lizards Caroline Daugherty Josh Laison Rebecca Robinson Kyle Salois Willamette Mathematics Consortium REU Willamette REU k -MSP Intersection Graphs

  1. A reflex angle in 3-MSP Consider a ✓ 4 angle in the following 3-lizard. There are 3 scales touching this reflex angle. We define a proto-scale to be a line segment contained in the interior of the k -lizard in a ✓ i direction which touches the boundary of the k -lizard at a reflex angle. Willamette REU k -MSP Intersection Graphs August 4, 2017 10 / 67

  2. Definitions Let r be a reflex angle in a k -lizard L with internal angle measure ✓ k + j . Then there exist j + 1 proto-scales, with each one contained in at least one scale. θ 7 A ✓ k + 3 reflex angle in 4-MSP yielding 4 proto-scales Willamette REU k -MSP Intersection Graphs August 4, 2017 11 / 67

  3. Definitions Let r be a reflex angle in a k -lizard L with internal angle measure ✓ k + j . Then there exist j + 1 proto-scales, with each one contained in at least one scale. θ 7 A ✓ k + 3 reflex angle in 4-MSP yielding 4 proto-scales Willamette REU k -MSP Intersection Graphs August 4, 2017 11 / 67

  4. Definitions Let r be a reflex angle in a k -lizard L with internal angle measure ✓ k + j . Then there exist j + 1 proto-scales, with each one contained in at least one scale. θ 7 A ✓ k + 3 reflex angle in 4-MSP yielding 4 proto-scales Willamette REU k -MSP Intersection Graphs August 4, 2017 11 / 67

  5. Definitions Let r be a reflex angle in a k -lizard L with internal angle measure ✓ k + j . Then there exist j + 1 proto-scales, with each one contained in at least one scale. θ 7 A ✓ k + 3 reflex angle in 4-MSP yielding 4 proto-scales Willamette REU k -MSP Intersection Graphs August 4, 2017 11 / 67

  6. Definitions Let r be a reflex angle in a k -lizard L with internal angle measure ✓ k + j . Then there exist j + 1 proto-scales, with each one contained in at least one scale. p θ 7 A ✓ k + 3 reflex angle in 4-MSP yielding 4 proto-scales Willamette REU k -MSP Intersection Graphs August 4, 2017 11 / 67

  7. Proto-scales Lemma We define a g -region of a k -lizard L as a region where g scales intersect. Lemma (Proto-scales) In a k-lizard at a reflex interior angle ✓ k + j , there is a g-region, where g � j + 1 . p θ 7 Willamette REU k -MSP Intersection Graphs August 4, 2017 12 / 67

  8. Proto-scales Lemma We define a g -region of a k -lizard L as a region where g scales intersect. Lemma (Proto-scales) In a k-lizard at a reflex interior angle ✓ k + j , there is a g-region, where g � j + 1 . p θ 7 Proof. By definition, at a reflex angle ✓ k + j , there are j + 1 distinct proto-scales that each belong to at least one scale in L . Each of these proto-scales intersect at p , so the scales formed by them must intersect as well, so there is a g -region at p . Willamette REU k -MSP Intersection Graphs August 4, 2017 12 / 67

  9. Ray Lemma Lemma Given three vertices a , b , c in a k-MSP graph with corresponding scales A , B , C such that a $ b and b $ c, but a = c, and from every point on the boundary of B � A there exists a ray in a ✓ i direction that intersects A, then there exists a scale D intersecting A , B , and C. C B p r A Willamette REU k -MSP Intersection Graphs August 4, 2017 13 / 67

  10. Ray Lemma Lemma Given three vertices a , b , c in a k-MSP graph with corresponding scales A , B , C such that a $ b and b $ c, but a = c, and from every point on the boundary of B � A there exists a ray in a ✓ i direction that intersects A, then there exists a scale D intersecting A , B , and C. C B p r A Proof. Since b $ c , but a = c , C must intersect boundary( B � A ) at two distinct points. Consider a point p on the boundary of both B � A and and C \ B and a ray r originating at p with ✓ i direction that intersects A . Willamette REU k -MSP Intersection Graphs August 4, 2017 13 / 67

  11. Ray Lemma C B D p’ ε p l A q Let ✏ > 0 such that B ✏ ( p ) is contained within P . Since B is convex, we can extend r by length ✏ into C � B at direction ✓ k + i to form a line segment ` with one endpoint p 0 . The opposite endpoint of ` should lie at a point q in A By Convex Subset Lemma, ` is contained in at least one scale and since it cannot be wholly contained in A , B , or C , there must exist an additional scale D that contains ` . Willamette REU k -MSP Intersection Graphs August 4, 2017 14 / 67

  12. Parallel Sides Lemma Lemma Given scales A , B , C in a lizard, if a $ b, b $ c, and a and b have no shared neighbors, then the region B � A � C that borders both A and C has parallel boundary components s 1 and s 2 extending from the corners of A \ B to the corners of B \ C. A s 1 B s 2 C Willamette REU k -MSP Intersection Graphs August 4, 2017 15 / 67

  13. Parallel Sides Lemma A s 1 Let � 1 be a boundary δ 1 B component between B � A s 2 and B \ A , and consider the C angle ↵ formed where � 1 reaches a side s 2 of B . If ↵  ✓ k � 2 , then we can use A s 1 the ray lemma to show that some scale intersects A and δ 1 B B . s 2 Willamette REU k -MSP Intersection Graphs August 4, 2017 16 / 67

  14. End Regions In a k -lizard L , we say that for a scales A and B , A \ B is an end region of A if A � B is connected. B B A A In a 3-lizard: an end region (left) and not an end region (right). Willamette REU k -MSP Intersection Graphs August 4, 2017 17 / 67

  15. End Regions In a k -lizard L , we say that for a scales A and B , A \ B is an end region of A if A � B is connected. B B A A In a 3-lizard: an end region (left) and not an end region (right). On the left, A \ B is an end region of A and B . Additionally, A \ B is a 2-region since it is contained in 2 different scales. We then say A \ B is an end 2-region of A . Willamette REU k -MSP Intersection Graphs August 4, 2017 17 / 67

  16. End 2-Regions Lemma Lemma (End 2-Regions) Any scale has at most two end 2-regions. A C B Willamette REU k -MSP Intersection Graphs August 4, 2017 18 / 67

  17. End 2-Regions Lemma Lemma (End 2-Regions) Any scale has at most two end 2-regions. A C B Proof. Suppose B has three end 2-regions; B \ A , B \ C , and B \ D . Willamette REU k -MSP Intersection Graphs August 4, 2017 18 / 67

  18. End 2-Regions Lemma Lemma (End 2-Regions) Any scale has at most two end 2-regions. A C B Proof. Suppose B has three end 2-regions; B \ A , B \ C , and B \ D . The sides between B \ A and B \ C must be parallel by the Parallel Sides Lemma. Willamette REU k -MSP Intersection Graphs August 4, 2017 18 / 67

  19. End 2-Regions Lemma Lemma (End 2-Regions) Any scale has at most two end 2-regions. A D C B Proof. Suppose B has three end 2-regions; B \ A , B \ C , and B \ D . The sides between B \ A and B \ C must be parallel by the Parallel Sides Lemma. The sides between B \ A and B \ D must be parallel; thus B \ D is either not an end region, or not a 2-region. Willamette REU k -MSP Intersection Graphs August 4, 2017 18 / 67

  20. End 2-Regions Lemma Lemma (End 2-Regions) Any scale has at most two end 2-regions. A C B D Proof. Suppose B has three end 2-regions; B \ A , B \ C , and B \ D . The sides between B \ A and B \ C must be parallel by the Parallel Sides Lemma. The sides between B \ A and B \ D must be parallel; thus B \ D is either not an end region, or not a 2-region. Willamette REU k -MSP Intersection Graphs August 4, 2017 18 / 67

  21. Summary of Lemmas Convex Subset Lemma Let R be a convex k -lizard contained within a k -lizard L . Then R is contained within at least one scale of L . R S Willamette REU k -MSP Intersection Graphs August 4, 2017 19 / 67

  22. Summary of Lemmas Convex Subset Lemma Let R be a convex k -lizard contained within a k -lizard L . Then R is contained within at least one scale of L . Proto-Scale Lemma In a k -lizard at a reflex interior angle ✓ k + j , there is a g -region, where g � j + 1. p θ 7 Willamette REU k -MSP Intersection Graphs August 4, 2017 19 / 67

  23. Summary of Lemmas Ray Lemma Given scales A , B , C in a k -lizard, if a $ b , b $ c , and a = c , and from every point on the boundary of B � A there exists a ray in a ✓ i direction that intersects A , then there exists a scale D intersecting A , B , and C . C B p r A Willamette REU k -MSP Intersection Graphs August 4, 2017 20 / 67

  24. Summary of Lemmas Ray Lemma Given scales A , B , C in a k -lizard, if a $ b , b $ c , and a = c , and from every point on the boundary of B � A there exists a ray in a ✓ i direction that intersects A , then there exists a scale D intersecting A , B , and C . Parallel Sides Lemma Given scales A , B , C in a k -lizard, if a $ b , b $ c , and a and b have no shared neighbors, then the region B � A � C has parallel boundary components s 1 and s 2 from A \ B to B \ C . A s 1 B s 2 C Willamette REU k -MSP Intersection Graphs August 4, 2017 20 / 67

  25. Summary of Lemmas Ray Lemma Given scales A , B , C in a k -lizard, if a $ b , b $ c , and a = c , and from every point on the boundary of B � A there exists a ray in a ✓ i direction that intersects A , then there exists a scale D intersecting A , B , and C . Parallel Sides Lemma Given scales A , B , C in a k -lizard, if a $ b , b $ c , and a and b have no shared neighbors, then the region B � A � C has parallel boundary components s 1 and s 2 from A \ B to B \ C . End 2-Region Lemma Any scale has at most two end 2-regions. A C B Willamette REU k -MSP Intersection Graphs August 4, 2017 20 / 67

  26. Separating Examples 2-MSP 3-MSP 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 21 / 67

  27. Graphs that are k -MSP Graphs Proposition (Complete Graphs). The complete graph K n is a k -MSP graph for all n , k 2 N , where k � 2. K 4 in 2-MSP , K 5 in 3-MSP , and 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 22 / 67

  28. Graphs that are k -MSP Graphs Proposition (Complete Graphs). The complete graph K n is a k -MSP graph for all n , k 2 N , where k � 2. K 4 in 2-MSP , K 5 in 3-MSP , and 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 22 / 67

  29. Graphs that are k -MSP Graphs Proposition (Complete Graphs). The complete graph K n is a k -MSP graph for all n , k 2 N , where k � 2. K 4 in 2-MSP , K 5 in 3-MSP , and 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 22 / 67

  30. Graphs that are k -MSP Graphs Proposition (Complete Graphs). The complete graph K n is a k -MSP graph for all n , k 2 N , where k � 2. K 4 in 2-MSP , K 5 in 3-MSP , and 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 22 / 67

  31. Graphs that are k -MSP Graphs Proposition (Complete Graphs). The complete graph K n is a k -MSP graph for all n , k 2 N , where k � 2. K 4 in 2-MSP , K 5 in 3-MSP , and 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 22 / 67

  32. Graphs that are k -MSP Graphs Proposition (Complete Graphs). The complete graph K n is a k -MSP graph for all n , k 2 N , where k � 2. K 4 in 2-MSP , K 5 in 3-MSP , and 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 22 / 67

  33. Graphs that are k -MSP Graphs Proposition (Complete Graphs). The complete graph K n is a k -MSP graph for all n , k 2 N , where k � 2. For k = 2, construct the "staircase" as shown previously, with n "stairs". For k � 3, construct the first scale A as a triangle with two ✓ 1 angles and one ✓ k � 2 angle. Add n � 1 bumps to the longest side of A , alternating directions of the other two sides of A . θ 1 θ 1 θ k-2 θ k-2 The construction of the 6-MSP representation of K 4 . Willamette REU k -MSP Intersection Graphs August 4, 2017 23 / 67

  34. Graphs that are k -MSP Graphs Proposition (Path Graphs). P j is a k -MSP graph for all j , k 2 N , and k � 2. The 2- and 3-MSP representation of P 6 . Willamette REU k -MSP Intersection Graphs August 4, 2017 24 / 67

  35. Graphs that are k -MSP Graphs Proposition (Path Graphs). P j is a k -MSP graph for all j , k 2 N , and k � 2. The 2- and 3-MSP representation of P 6 . For all k , construct the k -lizard with consecutive parallelograms Q 1 , ..., Q n , intersecting such that for all 1  a  n , Q a [ Q a + 1 is a polygon containing one reflex angle with measure ✓ k + 1 . Willamette REU k -MSP Intersection Graphs August 4, 2017 24 / 67

  36. Separating Examples 2-MSP 3-MSP K n P n 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 25 / 67

  37. Cycles are not k -MSP Graphs Theorem C j is not a k-MSP graph when j � 4 and k � 2 . Willamette REU k -MSP Intersection Graphs August 4, 2017 26 / 67

  38. Cycles are not k -MSP Graphs Theorem C j is not a k-MSP graph when j � 4 and k � 2 . Proof. Assume there exists a k -MSP representation of C j . j scales must intersect two "neighbor" scales. Connect one point in each intersection with line segments. P A C Note that each line segment must be contained in one of the j scales. B The j points and j line segments must form a closed path P , which must be contained in the k -lizard. Willamette REU k -MSP Intersection Graphs August 4, 2017 26 / 67

  39. Cycles are not k -MSP Graphs Theorem C j is not a k-MSP graph when j � 4 and k � 2 . Proof cont. Construct a convex k -lizard R such that R ✓ P is maximal inside P . The vertices of R must intersect at P least three distinct sides of P , thus R R must contain points from at least three distinct scales. Willamette REU k -MSP Intersection Graphs August 4, 2017 27 / 67

  40. Cycles are not k -MSP Graphs Theorem C j is not a k-MSP graph when j � 4 and k � 2 . Proof cont. R must be contained in a scale S of S L by the Convex Subset Lemma. S corresponds to a vertex with degree at least three, but all vertices R in C j must have degree two. So C j is not a k -MSP graph. Willamette REU k -MSP Intersection Graphs August 4, 2017 28 / 67

  41. Separating Examples 2-MSP 3-MSP K n P n C n (n>3) 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 29 / 67

  42. Induced Cycles in k -MSP Graphs Theorem C 5 is an induced subgraph for 3 and 4-MSP but not for 2-MSP . Proof ( C 5 is not an induced subgraph for 2-MSP). Recall from Shearer 1982 and Maire 1993, all 2-MSP graphs are perfect. C 5 is not perfect, so it cannot be a subgraph of a 2-MSP graph. Willamette REU k -MSP Intersection Graphs August 4, 2017 30 / 67

  43. Induced Cycles in k -MSP Graphs Theorem C 5 is an induced subgraph for 3 and 4-MSP but not for 2-MSP . Proof ( C 5 is not an induced subgraph for 2-MSP). Recall from Shearer 1982 and Maire 1993, all 2-MSP graphs are perfect. C 5 is not perfect, so it cannot be a subgraph of a 2-MSP graph. Maire also proved that C 4 is the largest induced cycle that can be made in 2-MSP . Willamette REU k -MSP Intersection Graphs August 4, 2017 30 / 67

  44. Induced Cycles in k -MSP Graphs Theorem C 5 is an induced subgraph for 3 and 4-MSP but not for 2-MSP . Proof ( C 5 is an induced subgraph for 3 and 4-MSP). See the constructions for an induced C 5 with 3 and 4-MSP . Willamette REU k -MSP Intersection Graphs August 4, 2017 31 / 67

  45. Separating Examples 2-MSP 3-MSP K n P n induced C 5 C n (n>3) 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 32 / 67

  46. Induced Cycles in k -MSP Graphs Proposition C n is an induced subgraph of a k -MSP graph when n � 3 and k � 5. Along one "direction," alternate two types of triangles: one with angle measures ( ✓ 1 , ✓ 1 , ✓ k � 2 ) , and another with angle measures ( ✓ 1 , ✓ 2 , ✓ k � 3 ) Construct n � 3 of these triangles, then complete the cycle with 3 paralellograms θ 1 θ k-3 θ k-2 θ 2 θ 1 θ 1 Willamette REU k -MSP Intersection Graphs August 4, 2017 33 / 67

  47. Induced Cycles in k -MSP Graphs Willamette REU k -MSP Intersection Graphs August 4, 2017 34 / 67

  48. Induced Cycles in k -MSP Graphs Conjecture In 3-MSP and 4-MSP , there is an upper bound on the size of the largest possible induced cycle. Alternating triangle construction fails because there is only one triangle possible in each case (60 , 60 , 60 in 3-MSP or 45 , 45 , 90 in 4-MSP) k -MSP Maximum Induced Cycle 2-MSP 4 (Maire) 3-MSP 12 4-MSP 16 (5+)-MSP unbounded Willamette REU k -MSP Intersection Graphs August 4, 2017 35 / 67

  49. Tree Graphs Theorem All tree graphs are 2-MSP graphs. a b c D E d e B C A Willamette REU k -MSP Intersection Graphs August 4, 2017 36 / 67

  50. Tree Graphs Theorem All tree graphs are 2-MSP graphs. a b c D E C d e f B F A Willamette REU k -MSP Intersection Graphs August 4, 2017 36 / 67

  51. Tree Graphs Theorem All tree graphs are 2-MSP graphs. a G b c D E C d e f B F g A Willamette REU k -MSP Intersection Graphs August 4, 2017 36 / 67

  52. Tree Graphs Theorem Tree graphs are k-MSP graphs for all k � 3 if and only if they are caterpillars. Willamette REU k -MSP Intersection Graphs August 4, 2017 37 / 67

  53. Tree Graphs Theorem Tree graphs are k-MSP graphs for all k � 3 if and only if they are caterpillars. Proof ( ( ) Recall the construction for P n for any k . We can extend any scale corresponding to any vertex of P . On any of the scales, we can add triangles with interior angles equal to ✓ k + 1 . A 3-lizard whose graph is a caterpillar Willamette REU k -MSP Intersection Graphs August 4, 2017 37 / 67

  54. Tree Graphs Proof ( ) ), by contradiction. g f a b c d e Recall that NC 7 (the smallest non-caterpillar with 7 vertices) is a subgraph of every tree that is not a caterpillar, so it suffices to show that NC 7 is not a k -MSP graph for all k � 3. By the End 2-Regions Lemma, the corresponding scale C has at most two end 2-regions and has parallel sides. Willamette REU k -MSP Intersection Graphs August 4, 2017 38 / 67

  55. Tree Graphs Proof ( ) ) cont. By the Proto-scales Lemma, the only angle that creates a 2-region is ✓ k + 1 . F θ k+1 θ k+1 C Note that from any point on boundary( F � C ) , there exists a ray in a ✓ i direction that intersects C . By the Ray Lemma, we cannot form another scale intersecting F without creating a scale that intersects both C and F . So a k -MSP tree graph G must be a caterpillar. Willamette REU k -MSP Intersection Graphs August 4, 2017 39 / 67

  56. Separating Examples 2-MSP 3-MSP NC 7 K n P n induced C 5 C n (n>3) 4-MSP Willamette REU k -MSP Intersection Graphs August 4, 2017 40 / 67

  57. Seagull Graphs We define the family of seagull graphs , Seagull n , to be a clique with n vertices joined to the third vertex of P 5 , with a pendant vertex adjacent to a different vertex of the clique. Seagull 2 ( NC 7 ) (left) and Seagull 3 (right) Willamette REU k -MSP Intersection Graphs August 4, 2017 41 / 67

  58. Seagull Graphs Theorem Seagull k � 1 is not a k-MSP graph, but is a ( k � 1 ) -MSP graph. Willamette REU k -MSP Intersection Graphs August 4, 2017 42 / 67

  59. Seagull Graphs Theorem Seagull k � 1 is not a k-MSP graph, but is a ( k � 1 ) -MSP graph. Proof ( Seagull k � 1 is not a k -MSP graph). K k -1 { G C Since C has two end 2-regions, it must have parallel sides between them (by Parallel Sides Lemma), so C � G cannot be an end region. Therefore, we just need to consider the reflex angles at C [ G . Willamette REU k -MSP Intersection Graphs August 4, 2017 42 / 67

  60. Seagull Graphs Case I: C [ G has one reflex angle. Willamette REU k -MSP Intersection Graphs August 4, 2017 43 / 67

  61. Seagull Graphs Case I: C [ G has one reflex angle. G must intersect C at at least two points, one of which is the reflex angle. To avoid second reflex angle, G must intersect at a corner of C . However, this causes G to intersect an end 2-region of C , making it no longer a 2-region. D G θ k+1 C Willamette REU k -MSP Intersection Graphs August 4, 2017 43 / 67

  62. Seagull Graphs Case II: C [ G has two reflex angles with measures ✓ k + i and ✓ k + j . Willamette REU k -MSP Intersection Graphs August 4, 2017 44 / 67

  63. Seagull Graphs Case II: C [ G has two reflex angles with measures ✓ k + i and ✓ k + j . We do not want to create any more than k � 2 scales (not including C ) for the k � 1 clique of the seagull, so each angle cannot create more than k � 2 proto-scales. This implies the maximum value for either i or j is k � 3. The minimum value for i or j is 1, else the angles would not be reflex. We then split Case II into three subcases. Willamette REU k -MSP Intersection Graphs August 4, 2017 44 / 67

  64. Seagull Graphs Case II.a: i + j < k Willamette REU k -MSP Intersection Graphs August 4, 2017 45 / 67

  65. Seagull Graphs Case II.a: i + j < k G θ k+i θ k+j C If i + j < k , the sides of G are not parallel and point towards each other. This means G � C forms a shape such that from every point on the boundary of G � C , we can construct a ray that intersects C . By the Ray Lemma, this means any scale intersecting G would also intersect C . Willamette REU k -MSP Intersection Graphs August 4, 2017 45 / 67

  66. Seagull Graphs Case II.b: i + j = k If i + j = k , the sides of G are parallel. We create ij scales with construction of G . θ k+ 3 θ k+ 2 C Willamette REU k -MSP Intersection Graphs August 4, 2017 46 / 67

  67. Seagull Graphs Case II.b: i + j = k If i + j = k , the sides of G are parallel. We create ij scales with construction of G . C θ k+ 2 θ k+ 3 Willamette REU k -MSP Intersection Graphs August 4, 2017 46 / 67

  68. Seagull Graphs Case II.b: i + j = k If i + j = k , the sides of G are parallel. We create ij scales with construction of G . C θ k+ 2 θ k+ 3 Willamette REU k -MSP Intersection Graphs August 4, 2017 46 / 67

  69. Seagull Graphs Case II.b: i + j = k If i + j = k , the sides of G are parallel. We create ij scales with construction of G . C θ k+ 2 θ k+ 3 Willamette REU k -MSP Intersection Graphs August 4, 2017 46 / 67

  70. Seagull Graphs Case II.b: i + j = k If i + j = k , the sides of G are parallel. We create ij scales with construction of G . C θ k+ 2 θ k+ 3 Willamette REU k -MSP Intersection Graphs August 4, 2017 46 / 67

  71. Seagull Graphs Case II.b: i + j = k If i + j = k , the sides of G are parallel. We create ij scales with construction of G . C θ k+ 2 θ k+ 3 Willamette REU k -MSP Intersection Graphs August 4, 2017 46 / 67

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

Drawing graphs with vertices and edges in convex position and large polygons in Minkowski sums

Drawing graphs with vertices and edges in convex position and large polygons in Minkowski sums

Drawing graphs with vertices and edges in convex position and large polygons in Minkowski sums Kolja Knauer Ignacio Garc a-Marco LIP ENS Lyon LIF Marseille Graph Drawing , September 29, 2015 P R 2 in strictly convex position if P is

969 views • 71 slides
Computing Distance Erin Catto Blizzard Entertainment Convex polygons Closest points Overlap

Computing Distance Erin Catto Blizzard Entertainment Convex polygons Closest points Overlap

Computing Distance Erin Catto Blizzard Entertainment Convex polygons Closest points Overlap Goal Compute the distance between convex polygons Keep in mind 2D Code not optimized Approach simple complex Geometry If all else

2.05k views • 165 slides
Linear Programming- Manufacturing with Computational Geometry Molds Manufacturing with Molds

Linear Programming- Manufacturing with Computational Geometry Molds Manufacturing with Molds

Yazd Univ. Linear Programming- Manufacturing with Computational Geometry Molds Manufacturing with Molds Half-plane intersection problem Computing 1395-2 intersection of two convex polygons Linear Programming Randomized Linear

711 views • 49 slides
Minkowski Sums and Offsets of Polygons Seminar Computational Geometry and Geometric Computing

Minkowski Sums and Offsets of Polygons Seminar Computational Geometry and Geometric Computing

Minkowski Sums and Offsets of Polygons Seminar Computational Geometry and Geometric Computing Andreas Bock Supervisor: Eric Berberich Overview Polygons Minkowski Sums Decomposing into convex sub-polygons Convolution method

1.01k views • 62 slides
Convex partitions of graphs Maya Stein Universidad de Chile with Luciano Grippo, Mart n

Convex partitions of graphs Maya Stein Universidad de Chile with Luciano Grippo, Mart n

Convex partitions of graphs Maya Stein Universidad de Chile with Luciano Grippo, Mart n Matamala, Mart n Safe Koper, June 2015 Euclidean convexity Convex Not convex Convex set C: has to contain all points on shortest lines between

1.37k views • 93 slides
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time Darren Strash Department of

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time Darren Strash Department of

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time Darren Strash Department of Computer Science UC Irvine Joint work with David Eppstein and Maarten L offler What is a Maximal Clique? A clique that cannot be extended by

1.74k views • 160 slides
Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms

Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms

Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Experience Report Ilya Sergey ICFP 2016 September 20th, 2016 Polygons Polygons Polygons Polygons Polygons are Trees Polygons are Trees We can

1.52k views • 116 slides
Graphs with convex-QP stability number Domingos M. Cardoso (Universidade de Aveiro) 1

Graphs with convex-QP stability number Domingos M. Cardoso (Universidade de Aveiro) 1

Universytet im. Adama Mickiewicza Pozna n, January 2004 Graphs with convex-QP stability number Domingos M. Cardoso (Universidade de Aveiro) 1 Summary Introduction. The class of Q -graphs. Adverse

595 views • 33 slides
On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs Vangelis Bartzos,

On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs Vangelis Bartzos,

On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs Vangelis Bartzos, Ioannis Z. Emiris, Jan Legersk, Elias Tsigaridas July 2018 The International Symposium on Symbolic and Algebraic Computation, New York A R C A D E S

537 views • 32 slides
Representing Graphs and Hypergraphs by Touching Polygons in 3D Pawe Rzewski, Noushin Saeedi

Representing Graphs and Hypergraphs by Touching Polygons in 3D Pawe Rzewski, Noushin Saeedi

Representing Graphs and Hypergraphs by Touching Polygons in 3D Pawe Rzewski, Noushin Saeedi joint work with William Evans, Chan-Su Shin, and Alexander Wolff How to draw a graph? (in 2d) non-crossing drawings How to draw a graph? (in

1.05k views • 58 slides
Visibility Graphs of Staircase Polygons Yulia Alexandr Mentor: Prof. James Abello NSF grant

Visibility Graphs of Staircase Polygons Yulia Alexandr Mentor: Prof. James Abello NSF grant

Visibility Graphs of Staircase Polygons Yulia Alexandr Mentor: Prof. James Abello NSF grant CCF-1559855 Let me remind you We consider a simple non-degenerate collection of points in the plane that produces a polygon v 1 u 1 In

886 views • 24 slides
On the intersection of random graphs with an application to random key pre-distribution ab Armand

On the intersection of random graphs with an application to random key pre-distribution ab Armand

NIST, ACMD Seminar Series, February 2014 1 On the intersection of random graphs with an application to random key pre-distribution ab Armand M. Makowski ECE &amp; ISR/HyNet University of Maryland at College Park armand@isr.umd.edu a Supported

767 views • 37 slides
CS 140: Computation on Graphs Maximal Independent Sets A graph problem: Maximal Independent

CS 140: Computation on Graphs Maximal Independent Sets A graph problem: Maximal Independent

CS 140: Computation on Graphs Maximal Independent Sets A graph problem: Maximal Independent Set Graph with vertices V = {1,2, ,n} 1 2 A set S of vertices is independent if no two vertices in S are neighbors. An independent

345 views • 12 slides
Convex hull 1 - 1 Convex hull 1 - 2 Convex hull 1 - 3 Convex hull Definition, extremal

Convex hull 1 - 1 Convex hull 1 - 2 Convex hull 1 - 3 Convex hull Definition, extremal

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.41k views • 114 slides
The Touring Polygons Problem (TPP) [Dror-Efrat-Lubiw-M]: Given a sequence of k polygons in the

The Touring Polygons Problem (TPP) [Dror-Efrat-Lubiw-M]: Given a sequence of k polygons in the

The Touring Polygons Problem (TPP) [Dror-Efrat-Lubiw-M]: Given a sequence of k polygons in the plane, a start point s , and a target point, t , we seek a shortest path that starts at s , visits in order each of the polygons, and ends at t . s P

552 views • 54 slides
Separating hyperplanes S a closed, convex set Point x not in S ==&gt; strict

Separating hyperplanes S a closed, convex set Point x not in S ==&gt; strict

Separating hyperplanes S a closed, convex set Point x not in S ==&gt; strict separating hyperplane Suppose S, T two closed convex sets Can they be strictly separated? Example Intersection and union (K 1 K 2 )* =

450 views • 25 slides
Investor Presentation August-October 2019 Disclaimer This document may contain forward-looking

Investor Presentation August-October 2019 Disclaimer This document may contain forward-looking

Investor Presentation August-October 2019 Disclaimer This document may contain forward-looking statements including words such as may, can, could, should, predict, aim, potential, continue,

515 views • 26 slides
A note to readers. This presentation was delivered on March 29th, 2019 during the Texas Section

A note to readers. This presentation was delivered on March 29th, 2019 during the Texas Section

A note to readers. This presentation was delivered on March 29th, 2019 during the Texas Section MAA Conference at Tarleton State University in Stephenville, Texas. The footnotes for this presentation are (basically) what was said to the

774 views • 56 slides
Vertex-Minimal ertex-Minimal Planar Planar Graphs Graphs with with a Prescrib Prescribed ed

Vertex-Minimal ertex-Minimal Planar Planar Graphs Graphs with with a Prescrib Prescribed ed

Vertex-Minimal ertex-Minimal Planar Planar Graphs Graphs with with a Prescrib Prescribed ed Automorphism utomorphism Group Group C.J. Jones, Sarah E. Lubow, and Carlie J. Triplitt University of Texas at Tyler Automorphism Group of a

435 views • 27 slides
OPENGL SCENE-RENDERING TECHNIQUES Christoph Kubisch, Senior Developer Technology Engineer New

OPENGL SCENE-RENDERING TECHNIQUES Christoph Kubisch, Senior Developer Technology Engineer New

OPENGL SCENE-RENDERING TECHNIQUES Christoph Kubisch, Senior Developer Technology Engineer New content compared to GTC SCENE RENDERING Scene complexity increases Deep hierarchies, traversal expensive Large objects split up into a lot

778 views • 57 slides
2018 State of the Construction and Surety Industries William J. McConnell, PE, JD, MSCE, CDT

2018 State of the Construction and Surety Industries William J. McConnell, PE, JD, MSCE, CDT

March-2018 2018 State of the Construction and Surety Industries William J. McConnell, PE, JD, MSCE, CDT Chief Executive Officer THE VERTEX COMPANIES, INC. Forensic Consulting | Design Engineering | Construction | Environmental 1 Executive

983 views • 77 slides
Transverse Impact Parameter Resolution &amp; Material Budget for CLIC and FCCee Peter Winkel

Transverse Impact Parameter Resolution &amp; Material Budget for CLIC and FCCee Peter Winkel

Transverse Impact Parameter Resolution &amp; Material Budget for CLIC and FCCee Peter Winkel Rasmussen July 25, 2017 Introduction The 2017-07-12 version of the ILC software was used. The CLIC o3 v11 and the FCCee o5 v03 detector models were

470 views • 10 slides
Investigating the scale-invariance of graph algorithm performance Tim van Zalingen UvA July 5,

Investigating the scale-invariance of graph algorithm performance Tim van Zalingen UvA July 5,

Investigating the scale-invariance of graph algorithm performance Tim van Zalingen UvA July 5, 2018 Supervisors (UvA): Merijn Verstraaten &amp; dr. ir. A.L. (Ana) Varbanescu Research Project 19 Tim van Zalingen (UvA) RP19 July 5, 2018 1 /

289 views • 17 slides
Construction of Covariant Vertex Operators in the Pure Spinor Formalism Sitender Kashyap

Construction of Covariant Vertex Operators in the Pure Spinor Formalism Sitender Kashyap

Construction of Covariant Vertex Operators in the Pure Spinor Formalism Sitender Kashyap (Institute of Physics, Bhubaneshwar, India ) Workshop on Fundamental Aspects of String Theory ( ICTP-SAIFR/IFT-UNESP, Sao-Paulo, Brazil) (Based on work in

778 views • 30 slides

More recommend