Results 231 to 240 of about 71,285 (269)

A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments

Information Processing Letters, 1998
A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line ...
Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia   +2 more
openalex   +2 more sources

Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three

Algorithmica, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pável Valtr   +5 more
openalex   +3 more sources

Planar Straight Line Graphs

, 2004
Siu-Wing Cheng
  +6 more sources

Some of the next articles are maybe not open access.

Related searches:

Straight Line Representations of Infinite Planar Graphs

Journal of the London Mathematical Society, 1977
C. Thomassen
openaire   +3 more sources

Acute Constraints in Straight-Line Drawings of Planar Graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019
Seto Akane, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades   +3 more
openalex   +2 more sources

Straight Line Embeddings of Planar Graphs on Point Sets

, 1996
Netzahualcoyotl Castañeda, Jorge Urrutia   +1 more
openalex   +2 more sources

Morphing Planar Graph Drawings Through 3D

Conference on Current Trends in Theory and Practice of Informatics, 2022
In this paper, we investigate crossing-free 3D morphs between planar straight-line drawings. We show that, for any two (not necessarily topologically equivalent) planar straight-line drawings of an $n$-vertex planar graph, there exists a piecewise-linear
K. Buchin, W. Evans, Fabrizio Frati, I. Kostitsyna, M. Löffler, Tim Ophelders, A. Wolff   +6 more
semanticscholar   +1 more source

On Planar Straight-Line Dominance Drawings

Workshop on Algorithms and Data Structures
We study the following question, which has been considered since the 90's: Does every $st$-planar graph admit a planar straight-line dominance drawing? We show concrete evidence for the difficulty of this question, by proving that, unlike upward planar ...
Patrizio Angelini, M. Bekos, G. Battista, Fabrizio Frati, Luca Grilli, Giacomo Ortali   +5 more
semanticscholar   +1 more source

Planar Straight-Line Embedding of Double-Tree Scan Architecture on a Rectangular Grid

Fundamenta Informaticae, 2008
Double-tree-scan (DTS) is a new scan-path architecture that is deemed to be suitable for low-power testing of VLSI circuits. A full DTS resembles two complete k-level (k > 0) binary trees whose leaf nodes are merged pair-wise, and thus consists of ...
I. Saha, B. Bhattacharya, Shenmin Zhang, S. Seth   +3 more
semanticscholar   +1 more source

Morphing Planar Graph Drawings via Orthogonal Box Drawings

International Symposium Graph Drawing and Network Visualization
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph on an $O(n ...
Therese Biedl, A. Lubiw, Jack Spalding-Jamieson   +2 more
semanticscholar   +1 more source