On self-approaching and increasing-chord drawings of 3-connected planar graphs

@inproceedings{Nllenburg2016OnSA,
  title={On self-approaching and increasing-chord drawings of 3-connected planar graphs},
  author={Martin N{\"o}llenburg and Roman Prutkin and Ignaz Rutter},
  booktitle={J. Comput. Geom.},
  year={2016}
}
An st-path in a drawing of a graph is self-approaching if during a traversal of the corresponding curve from s to any point t' on the curve the distance to t' is non-increasing. A path has increasing chords if it is self-approaching in both directions. A drawing is self-approaching increasing-chord if any pair of vertices is connected by a self-approaching increasing-chord path. We study self-approaching and increasing-chord drawings of triangulations and 3-connected planar graphs. We show… 
View PDF on arXiv
18 Citations
Highly Influential Citations
1
Background Citations
9
Methods Citations
1
Results Citations
1

18 Citations

Citation Type

Citation Type

(Weakly) Self-approaching geometric graphs and spanners
On Planar Greedy Drawings of 3-Connected Planar Graphs
TLDR
It is proved that every 3-connected planar graph admits a planar greedy drawing, which constitutes a natural intermediate step towards a proof of the convex greedy embedding conjecture.
Self-Approaching Paths in Simple Polygons
TLDR
It is shown that a shortest self-approaching path connecting two points inside a polygon can be forced to follow a general class of non-algebraic curves.
On the construction of increasing-chord graphs on convex point sets
  • K. Mastakas, A. Symvonis
  • Mathematics
    2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)
  • 2015
TLDR
It is shown that given a convex point set P in the plane the authors can construct an increasing-chord graph consisting of P, at most one Steiner point and at most 4|P| - 8 edges.
Strongly Monotone Drawings of Planar Graphs
TLDR
This work presents algorithms to compute crossing-free strongly monotone drawings for some classes of planar graphs; namely, 3-connected planar graph, outerplanar graphs, and 2-trees, and their drawings are strictly convex.
Greedy Rectilinear Drawings
TLDR
This work introduces greedy rectilinear drawings, in which each edge is either a horizontal or a vertical segment, and gives a combinatorial characterization and, based on it, a polynomial-time testing and drawing algorithm for a meaningful subset of instances.
Optimal Monotone Drawings of Trees
TLDR
An algorithm for constructing monotone drawings of trees on a grid of size at most 12n x 12n is presented, and the smaller drawing size is achieved by a new simple Path Draw algorithm, and a procedure that carefully assigns primitive vectors to the paths of the input tree T.
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
TLDR
This work shows that minimum decomposition is still NP-hard for graphs with cycles, but can be solved optimally for trees in polynomial time, and gives a 2-approximation for simple polygons, if a given triangulation has to be respected.
Exploring Increasing-Chord Paths and Trees
TLDR
It is proved that given a vertex $r$ in a straight-line drawing $\Gamma$, it is NP-complete to determine whether $Gamma$ contains an increasing-chord spanning tree rooted at $r$.
Increasing-Chord Graphs On Point Sets
TLDR
It is proved that, for every point set P with n points, there exists an increasing-chord planar graph with On Steiner points spanning P.
...
...

References

SHOWING 1-10 OF 33 REFERENCES
Self-approaching Graphs
TLDR
It is shown that there are efficient algorithms to test if a polygonal path is self-approaching inℝ2 and ℝ3, but it is NP-hard to testif a given graph drawing in �”3 has a self- Approaching uv-path.
On Monotone Drawings of Trees
TLDR
It is shown how to construct a monotone drawing of a tree with n vertices on an On 1.5 ×On 1.
Monotone Drawings of Graphs with Fixed Embedding
TLDR
It is proved that biconnected embedded planar graphs and outerplane graphs always admit planar monotone drawings, and the linear-time drawing algorithms for these two graph classes are described.
On a Conjecture Related to Geometric Routing
Greedy Drawings of Triangulations
TLDR
It is shown, using the Knaster–Kuratowski–Mazurkiewicz Theorem, that some drawing of G belonging to this class is greedy, and a whole class of drawings of any given triangulation G is obtained.
Succinct strictly convex greedy drawing of 3-connected plane graphs
Increasing-Chord Graphs On Point Sets
TLDR
It is proved that, for every point set P with n points, there exists an increasing-chord planar graph with On Steiner points spanning P.
An Algorithm to Construct Greedy Drawings of Triangulations
TLDR
An algorithm to construct a greedy drawing of every given triangulation is shown, which proves a conjecture by Papadimitriou and Ratajczak and was independently shown by Leighton and Moitra.
Self-approaching curves
We present a new class of curves which are self-approaching in the following sense. For any three consecutive points a, b, c on the curve the point b is closer to c than a to c. This is a…
Succinct Greedy Drawings Do Not Always Exist
TLDR
It is shown that there exist greedy‐drawable graphs that do not admit any greedy drawing in which the Cartesian coordinates have less than a polynomial number of bits.
...
...