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

Revision as of 08:02, 18 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

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 @@
+Smooth Orthogonal Drawings of Planar Graphs
@@ Property / cites work: Smooth Orthogonal Drawings of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
+Normal rank
@@ Property / cites work @@
+Improved Primitives for Secure Multiparty Integer Computation
+Normal rank
@@ Property / cites work @@
+Approximate common divisors via lattices
@@ Property / cites work: Approximate common divisors via lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Support-vector networks
@@ Property / cites work: Support-vector networks / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
+Normal rank
@@ Property / cites work @@
+Computing orthogonal drawings with the minimum number of bends
+Normal rank
@@ Property / cites work @@
+A better heuristic for orthogonal graph drawings
@@ Property / cites work: A better heuristic for orthogonal graph drawings / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for drawing a planar graph on a grid
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of HV-rectilinear Planarity Testing
+Normal rank
@@ Property / cites work @@
+Lombardi Drawings of Graphs
@@ Property / cites work: Lombardi Drawings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing HV-Restricted Planar Graphs
@@ Property / cites work: Drawing HV-Restricted Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Lombardi Drawings for Subcubic Graphs
@@ Property / cites work: Planar Lombardi Drawings for Subcubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821954
@@ Property / cites work: Q4821954 / rank @@
+Normal rank
@@ Property / cites work @@
+How to share a secret
@@ Property / cites work: How to share a secret / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Hanani-Tutte and Monotone Drawings
@@ Property / cites work: Hanani-Tutte and Monotone Drawings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Upward and Rectilinear Planarity Testing
+Normal rank
@@ Property / cites work @@
+The Planar Slope Number of Subcubic Graphs
@@ Property / cites work: The Planar Slope Number of Subcubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873740
@@ Property / cites work: Q4873740 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing planar graphs using the canonical ordering
+Normal rank
@@ Property / cites work @@
+Drawing graphs. Methods and models
@@ Property / cites work: Drawing graphs. Methods and models / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing Planar Graphs of Bounded Degree with Few Slopes
+Normal rank
@@ Property / cites work @@
+A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+On Embedding a Graph in the Grid with the Minimum Number of Bends
+Normal rank