In graph drawing and geometric graph theory, the slope number of a graph is the minimum possible number of distinct slopes of edges in a drawing ofâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2017

Review

2017

- Udo Hoffmann
- J. Graph Algorithms Appl.
- 2017

The planar slope number of a planar graph G is defined as the minimum number of slopes that is required for a crossing-freeâ€¦Â (More)

Is this relevant?

2017

2017

- Michael Richter, Luke G. Rogers
- Discrete Mathematics
- 2017

The notion of an abstract convex geometry, due to Edelman and Jamison (1984), offers an abstraction of the standard notion ofâ€¦Â (More)

Is this relevant?

2017

2017

We describe a set of âˆ† âˆ’ 1 slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree âˆ† â‰¥ 4; thisâ€¦Â (More)

Is this relevant?

2016

2016

- Michael A. Bekos, Michael Kaufmann, Robert Krug
- LATIN
- 2016

An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal atâ€¦Â (More)

Is this relevant?

Review

2014

Review

2014

- Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
- Graph Drawing
- 2014

A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at mostâ€¦Â (More)

Is this relevant?

2013

2013

- William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
- Graph Drawing
- 2013

We prove tight bounds (up to a small multiplicative or additive constant) for the plane and the planar slope numbers of partial 2â€¦Â (More)

Is this relevant?

2010

2010

- Anchana Khemphila, Veera Boonjing
- 2010 International Conference on Computerâ€¦
- 2010

In this study, performances of classification techniques were compared in order to predict the presence of the patients getting aâ€¦Â (More)

Is this relevant?

2009

2009

- VÃt JelÃnek, Eva JelÃnkovÃ¡, Jan KratochvÃl, Bernard LidickÃ½, Marek Tesar, TomÃ¡s Vyskocil
- Graph Drawing
- 2009

It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. Weâ€¦Â (More)

Is this relevant?

2007

2007

- Vida Dujmovic, Matthew Suderman, David R. Wood
- Comput. Geom.
- 2007

The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. Weâ€¦Â (More)

Is this relevant?

2006

2006

- JÃ¡nos Pach, DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi
- Electr. J. Comb.
- 2006

We construct graphs with n vertices of maximum degree 5 whose every straight-line drawing in the plane uses edges of at least n1â€¦Â (More)

Is this relevant?