On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861): Difference between revisions

Revision as of 03:55, 19 July 2024

scientific article; zbMATH DE number 7026987

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

Language	Label	Description	Also known as
English	On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings	scientific article; zbMATH DE number 7026987	On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

Statements

instance of

scholarly article

0 references

title

On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (English)

0 references

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

7 May 2019

0 references

20 February 2019

0 references

full work available at URL

https://arxiv.org/abs/1708.09197

0 references

zbMATH Keywords

graph drawing

0 references

smooth orthogonal

0 references

octilinear

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Smooth Orthogonal Drawings of Planar Graphs

0 references

On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings

0 references

Improved Primitives for Secure Multiparty Integer Computation

0 references

Approximate common divisors via lattices

0 references

Support-vector networks

0 references

Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy

0 references

Computing orthogonal drawings with the minimum number of bends

0 references

A better heuristic for orthogonal graph drawings

0 references

A linear-time algorithm for drawing a planar graph on a grid

0 references

Q3154375

0 references

On the Complexity of HV-rectilinear Planarity Testing

0 references

Lombardi Drawings of Graphs

0 references

Drawing HV-Restricted Planar Graphs

0 references

Planar Lombardi Drawings for Subcubic Graphs

0 references

Q4821954

0 references

How to share a secret

0 references

How to draw a planar graph on a grid

0 references

Hanani-Tutte and Monotone Drawings

0 references

Q4198056

0 references

On the Computational Complexity of Upward and Rectilinear Planarity Testing

0 references

The Planar Slope Number of Subcubic Graphs

0 references

Q4873740

0 references

Drawing planar graphs using the canonical ordering

0 references

Drawing graphs. Methods and models

0 references

Drawing Planar Graphs of Bounded Degree with Few Slopes

0 references

A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid

0 references

Complexity of Finding Non-Planar Rectilinear Drawings of Graphs

0 references

Q3138887

0 references

On Embedding a Graph in the Grid with the Minimum Number of Bends

0 references

Planar Octilinear Drawings with One Bend Per Edge

0 references

Smooth Orthogonal Layouts

0 references

On the Total Number of Bends for Planar Octilinear Drawings

0 references

Orthogonal graph drawing with flexibility constraints

0 references

Orthogonal graph drawing with inflexible edges

0 references

Arc Diagrams, Flip Distances, and Hamiltonian Triangulations

0 references

Q4281651

0 references

Q3102944

0 references

Identifiers

zbMATH Open document ID

1421.68106

0 references

1503.68205

0 references

DOI

10.1007/s00453-018-0523-5

0 references

10.1007/978-3-319-73915-1_15

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1741861

@@ Property / cites work @@
+Planar Octilinear Drawings with One Bend Per Edge
@@ Property / cites work: Planar Octilinear Drawings with One Bend Per Edge / rank @@
+Normal rank
@@ Property / cites work @@
+Smooth Orthogonal Layouts
@@ Property / cites work: Smooth Orthogonal Layouts / rank @@
+Normal rank
@@ Property / cites work @@
+On the Total Number of Bends for Planar Octilinear Drawings
+Normal rank
@@ Property / cites work @@
+Orthogonal graph drawing with flexibility constraints
+Normal rank
@@ Property / cites work @@
+Orthogonal graph drawing with inflexible edges
@@ Property / cites work: Orthogonal graph drawing with inflexible edges / rank @@
+Normal rank
@@ Property / cites work @@
+Arc Diagrams, Flip Distances, and Hamiltonian Triangulations
+Normal rank
@@ Property / cites work @@
+Q4281651
@@ Property / cites work: Q4281651 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3102944
@@ Property / cites work: Q3102944 / rank @@
+Normal rank