planar embeddings of graphs with specified edge lengths
play

Planar Embeddings of Graphs with Specified Edge Lengths Sergio - PowerPoint PPT Presentation

Jan 17, 2024 •275 likes •723 views

Planar Embeddings of Graphs with Specified Edge Lengths Sergio Cabello GIVE, University Utrecht Erik D. Demaine MIT G unter Rote FU Berlin Problem and motivation Given a graph G Sergio Cabello, sergio@cs.uu.nl, 2/11 Problem and

  1. Planar Embeddings of Graphs with Specified Edge Lengths Sergio Cabello GIVE, University Utrecht Erik D. Demaine MIT G¨ unter Rote FU Berlin

  2. Problem and motivation Given a graph G Sergio Cabello, sergio@cs.uu.nl, 2/11

  3. Problem and motivation Given a graph G 3 3 1 2 3 2 1 1 1 1 1 2 2 2 1 1 3 2 and specified edge lengths Question: Can we draw G with these edge lengths? Sergio Cabello, sergio@cs.uu.nl, 2/11

  4. Problem and motivation Applications: • Sensor networks • Structural analysis of molecules • Linear cartograms Sergio Cabello, sergio@cs.uu.nl, 3/11

  5. Our results Restriction to planar embeddings (so planar graphs): • Triangulated graphs ⇒ linear time decision   3-connected ( → fixed topology)         unit edge lengths,     • ⇒ NP-hard. bounded face degree, and           generically rigid     2-connected + unit length, or   Improves Eades and Wormald ’90 3-connected   also in simplicity Sergio Cabello, sergio@cs.uu.nl, 4/11

  6. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. Sergio Cabello, sergio@cs.uu.nl, 5/11

  7. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. Sergio Cabello, sergio@cs.uu.nl, 5/11

  8. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Sergio Cabello, sergio@cs.uu.nl, 5/11

  9. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Sergio Cabello, sergio@cs.uu.nl, 5/11

  10. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Sergio Cabello, sergio@cs.uu.nl, 5/11

  11. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Sergio Cabello, sergio@cs.uu.nl, 5/11

  12. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Sergio Cabello, sergio@cs.uu.nl, 5/11

  13. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Sergio Cabello, sergio@cs.uu.nl, 5/11

  14. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Sergio Cabello, sergio@cs.uu.nl, 5/11

  15. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Sergio Cabello, sergio@cs.uu.nl, 5/11

  16. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] ⇒ In R 2 : fixing outer face, the topology is completely fixed. ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. 1 3 2 8 4 5 7 6 Longest edge in the outermost face ⇒ Two outer face candidates. Sergio Cabello, sergio@cs.uu.nl, 5/11

  17. Triangulated graphs Planar triangulation ⇒ Planar 3-connected Planar 3-connected ⇒ One topological embedding in S 2 [Whitney] . e ⇒ In R 2 : fixing outer face, m the topology is completely fixed. i t r ⇒ Fixed outer face, incremental treatment of triangles in O ( n ) time. a e n 1 3 2 8 i 4 L 5 7 6 Longest edge in the outermost face ⇒ Two outer face candidates. Sergio Cabello, sergio@cs.uu.nl, 5/11

  18. NP-hardness Th: It is NP-hard for planar 3-connected graphs. Reduction from planar 3-SAT v 1 v 2 v 3 v 4 v 5 v n . . . Sergio Cabello, sergio@cs.uu.nl, 6/11

  19. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  20. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  21. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  22. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  23. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  24. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  25. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  26. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  27. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  28. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  29. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  30. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  31. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  32. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  33. NP-hardness v 3 v 4 v 5 The holder gadget. Sergio Cabello, sergio@cs.uu.nl, 7/11

  34. NP-hardness The variable gadget. v 3 v 4 v 5 (true literal ≡ pushing towards variable) ¬ v i v i v i v i ≡ true ¬ v i v i v i Sergio Cabello, sergio@cs.uu.nl, 8/11

  35. NP-hardness The variable gadget. v 3 v 4 v 5 (true literal ≡ pushing towards variable) ¬ v i v i v i v i ≡ false ¬ v i v i v i Sergio Cabello, sergio@cs.uu.nl, 8/11

  36. NP-hardness The inverter gadget. pushing towards variable v 3 v 4 v 5 � pushing towards clause Sergio Cabello, sergio@cs.uu.nl, 9/11

  37. NP-hardness The inverter gadget. pushing towards variable v 3 v 4 v 5 � pushing towards clause Sergio Cabello, sergio@cs.uu.nl, 9/11

  38. NP-hardness The inverter gadget. pushing towards variable v 3 v 4 v 5 � pushing towards clause Sergio Cabello, sergio@cs.uu.nl, 9/11

  39. NP-hardness The clause gadget. v 3 v 4 v 5 (realizable ⇔ ∃ literal pushing towards clause) l i ≡ false l j ≡ false the same l k ≡ false Sergio Cabello, sergio@cs.uu.nl, 10/11

  40. NP-hardness The clause gadget. v 3 v 4 v 5 (realizable ⇔ ∃ literal pushing towards clause) l i ≡ true l j ≡ false l k ≡ false Sergio Cabello, sergio@cs.uu.nl, 10/11

  41. NP-hardness The clause gadget. v 3 v 4 v 5 (realizable ⇔ ∃ literal pushing towards clause) l i ≡ true l j ≡ true l k ≡ true Sergio Cabello, sergio@cs.uu.nl, 10/11

  42. NP-hardness The clause gadget. v 3 v 4 v 5 (realizable ⇔ ∃ literal pushing towards clause) l i ≡ false l j ≡ false l k ≡ true Sergio Cabello, sergio@cs.uu.nl, 10/11

  43. What did I explain? Planar drawing of graphs with specified edge lengths. • ⇒ linear time decision Triangulated graphs   3-connected ( → fixed topology)         unit edge lengths,     • ⇒ NP-hard. bounded face degree, and           generically rigid   Sergio Cabello, sergio@cs.uu.nl, 11/11

  44. Contents • Problem and motivation • Our results • Triangulated graphs • NP-hardness • What did I explain? Sergio Cabello, sergio@cs.uu.nl, 12/11

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

8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the

8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the

8.7.1 Section 8.7 Planar Graphs 8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the plane. Given a graph G and a Imbedding Problem: surface S , is it possible to draw G on S without any

372 views • 18 slides
Three Edge Lengths Suffice For Drawing Outerplanar Graphs Noga Alon Ohad N. Feldheim Tel-Aviv

Three Edge Lengths Suffice For Drawing Outerplanar Graphs Noga Alon Ohad N. Feldheim Tel-Aviv

Preliminaries Results Approaching the Problem Remarks and Open Problems Three Edge Lengths Suffice For Drawing Outerplanar Graphs Noga Alon Ohad N. Feldheim Tel-Aviv University IMU, 2012 Noga Alon and Ohad N. Feldheim Three Edge Lengths

717 views • 55 slides
On metric embeddings, shortest path decompositions and face cover of planar graphs Arnold

On metric embeddings, shortest path decompositions and face cover of planar graphs Arnold

On metric embeddings, shortest path decompositions and face cover of planar graphs Arnold Filtser Ben-Gurion University Arnold Filtser On metric embeddings, shortest path decompositions and face cover of planar graphs 1 / 34 This talk is

1.59k views • 144 slides
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths Zachary Abel, Erik D.

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths Zachary Abel, Erik D.

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein , Anna Lubiw, and Ryuhei Uehara Graph Drawing 2014 Why is it useful to flatten things? Many situations in

371 views • 17 slides
Lecture 6. Planar graphs. Eulers Formula. A graph that can be drawn in the plane without edge

Lecture 6. Planar graphs. Eulers Formula. A graph that can be drawn in the plane without edge

Lecture 6. Planar graphs. Eulers Formula. A graph that can be drawn in the plane without edge crossings. Eulers Formula. Faces: connected regions of the plane. Planar Six and then Five Color theorem. How many faces for Planar? Yes for

306 views • 5 slides
Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California,

Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California,

Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California, Irvine Symposium on Computational Geometry, June 2019 Planar graph drawing on one line Always possible using 2 semicircles per edge Planar graph

432 views • 16 slides
Shortest Paths, and Dijkstras Algorithm: Overview Graphs with lengths/weights/costs on edges.

Shortest Paths, and Dijkstras Algorithm: Overview Graphs with lengths/weights/costs on edges.

Shortest Paths, and Dijkstras Algorithm: Overview Graphs with lengths/weights/costs on edges. Shortest paths in edge-weighted graphs Dijkstas classic algorithm for computing single-source shortest paths. Kousha Etessami (U. of Edinburgh,

716 views • 13 slides
LAGOS 2017 Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs Isidoro

LAGOS 2017 Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs Isidoro

Almost-planar graphs Deltawye reduction of almost-planar graph Almost-planar graphs on the projective plane Deltawye reduction with terminals of almost-planar graphs Future Research LAGOS 2017 Delta-Wye Transformations and the Efficient

1.3k views • 45 slides
Greedy algorithms Problem. Given a digraph G = ( V , E ) , edge lengths e 0 , source s

Greedy algorithms Problem. Given a digraph G = ( V , E ) , edge lengths e 0 , source s

Shortest-paths problem Greedy algorithms Problem. Given a digraph G = ( V , E ) , edge lengths e 0 , source s V , and destination t V , find the shortest directed path from s to t . Shortest paths in weighted graphs Tyler Moore

641 views • 6 slides
Today. Graph Coloring. Planar graphs and maps. Given G = ( V , E ) , a coloring of a G assigns

Today. Graph Coloring. Planar graphs and maps. Given G = ( V , E ) , a coloring of a G assigns

Today. Graph Coloring. Planar graphs and maps. Given G = ( V , E ) , a coloring of a G assigns colors to vertices V Planar graph coloring map coloring. where for each edge the endpoints have different colors. Planar Five Color theorem.

540 views • 4 slides
Maximizing Ink in Partial Edge Drawings of k -plane Graphs Matthias Hummel, Fabian Klute, Soeren

Maximizing Ink in Partial Edge Drawings of k -plane Graphs Matthias Hummel, Fabian Klute, Soeren

Maximizing Ink in Partial Edge Drawings of k -plane Graphs Matthias Hummel, Fabian Klute, Soeren Nickel, Martin N ollenburg GD 2019 September 19, 2019 Partial Edge Drawings (PED) How to draw non-planar graphs? Just hide the edge crossings!

785 views • 77 slides
Planar Subdivision Let G =( V , E ) be an undirected graph. G is planar if it can be embedded

Planar Subdivision Let G =( V , E ) be an undirected graph. G is planar if it can be embedded

Planar Subdivision Let G =( V , E ) be an undirected graph. G is planar if it can be embedded in the plane without edge crossings. planar K 5 , not planar K 3,3 , not planar A planar embedding (=drawing) of a planar graph G induces

266 views • 5 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
On the Edge-Length Ratio of Planar Graphs Manuel Borrazzo and Fabrizio Frati Roma Tre University

On the Edge-Length Ratio of Planar Graphs Manuel Borrazzo and Fabrizio Frati Roma Tre University

On the Edge-Length Ratio of Planar Graphs Manuel Borrazzo and Fabrizio Frati Roma Tre University The 27 th International Symposium on Graph Drawing and Network Visualization 18 th September 2019 18 th September 2019 Manuel Borrazzo and Fabrizio

816 views • 26 slides
1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area Steven Chaplick, Fabian Lipp,

1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area Steven Chaplick, Fabian Lipp,

1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area Steven Chaplick, Fabian Lipp, Alexander Wolff, and Johannes Zink Beyond-Planar Graphs 2 Types of Drawings: Planar: No crossings Beyond-Planar Graphs 2 Types of Drawings:

1.12k views • 107 slides
Week 2 Student Responsibilities Mat 3770 Reading: Isomorphism, Edge Counting, Planar

Week 2 Student Responsibilities Mat 3770 Reading: Isomorphism, Edge Counting, Planar

Week 2 Student Responsibilities Mat 3770 Reading: Isomorphism, Edge Counting, Planar Graphs Week 2 Homework from Tucker & Rosen Attendence Slushily Encouraged Spring 2014 1 2 Section 1.2. Isomorphism Isomorphism Two

849 views • 7 slides
On the numerical simulation of nonlinear convection-aggregation equations by evolving

On the numerical simulation of nonlinear convection-aggregation equations by evolving

On the numerical simulation of nonlinear convection-aggregation equations by evolving diffeomorphisms J. Carrillo, H. Ranetbauer and M.T. Wolfram RICAM Workshop on Optimal Transport in the Applied Sciences Linz, December 2014 Special

504 views • 28 slides
Rectangular Representation of Weighted Outerplanar Graphs Lorenz Reinhart October 01, 2014

Rectangular Representation of Weighted Outerplanar Graphs Lorenz Reinhart October 01, 2014

Bachelor Colloquium Rectangular Representation of Weighted Outerplanar Graphs Lorenz Reinhart October 01, 2014 Supervisors Philipp Kindermann & Alexander Wolff Chair of Computer Science I Universit at W urzburg Motivation

1.3k views • 103 slides
Areal statistics Barry Rowlingson Research Fellow DataCamp Spatial Statistics in R Borders

Areal statistics Barry Rowlingson Research Fellow DataCamp Spatial Statistics in R Borders

DataCamp Spatial Statistics in R SPATIAL STATISTICS IN R Areal statistics Barry Rowlingson Research Fellow DataCamp Spatial Statistics in R Borders DataCamp Spatial Statistics in R US Congressional Borders DataCamp Spatial Statistics in

739 views • 42 slides
- Symfony2 MVC Model

- Symfony2 MVC Model

- Symfony2 MVC Model View Controller

757 views • 32 slides
Extraction of Programs from Proofs using Postulated Axioms Anton Setzer Swansea University,

Extraction of Programs from Proofs using Postulated Axioms Anton Setzer Swansea University,

Extraction of Programs from Proofs using Postulated Axioms Anton Setzer Swansea University, Swansea UK (Joint work with Chi Ming Chuang) 10 October 2011 1/ 31 1. Agda in 5 Slides 2. Real Number Computations in Agda 3. Theory of Program

489 views • 31 slides
Generalized Fermat principle and Zermelo navigation: a link between Lorentzian and Generalized

Generalized Fermat principle and Zermelo navigation: a link between Lorentzian and Generalized

Overview Introduction Finslerian and spacetime viewpoints Background: Riemann-Finsler, Lorentz Applications: Fermat and Zermelo Fermat vs Zermelo Generalized Fermat principle and Zermelo navigation: a link between Lorentzian and Generalized

1.04k views • 103 slides
Detecting the source of spread in complex networks Krzysztof Suchecki 08/29/2019, Troy Plan

Detecting the source of spread in complex networks Krzysztof Suchecki 08/29/2019, Troy Plan

Detecting the source of spread in complex networks Krzysztof Suchecki 08/29/2019, Troy Plan Spreading processes and sources Source search in networks Pinto-Thiran-Vetterli algorithm Beyond basic methods Spreading processess and

690 views • 33 slides
Prediction and Control by Dynamic Programing CS60077: Reinforcement Learning Abir Das IIT

Prediction and Control by Dynamic Programing CS60077: Reinforcement Learning Abir Das IIT

Prediction and Control by Dynamic Programing CS60077: Reinforcement Learning Abir Das IIT Kharagpur Aug 8,9,29,30, Sep 05, 2019 Agenda DP Policy Evaluation Policy Iteration Value Iteration Mathematical Tools DP Extensions Agenda

908 views • 76 slides

More recommend