The complexity of drawing a graph in a polygonal region
type: Item
instance of: scholarly article
title: The complexity of drawing a graph in a polygonal region
DOI: 10.1007/978-3-030-04414-5_28
author: Anna Lubiw
author: Tillmann Miltzow
author: Debajyoti Mondal
publication date: 2019-02-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1802.06699
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7023839
MaRDI profile type: Publication
OpenAlex ID: W2963616416
cites work: Irrational Guards are Sometimes Needed
cites work: The art gallery problem is ∃ ℝ-complete
cites work: Testing Planarity of Partially Embedded Graphs
cites work: Minimum-link watchman tours
cites work: The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
cites work: Some provably hard crossing number problems
cites work: Graph Drawing
cites work: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
cites work: Drawing Partially Embedded and Simultaneously Planar Graphs
cites work: \(\forall\exists\mathbb {R}\)-completeness and area-universality
cites work: Q5786239
cites work: Discrete one-forms on meshes and applications to 3D mesh parameterization
cites work: Convex drawings of graphs with non-convex boundary constraints
cites work: On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
cites work: Q2978407
cites work: Intersection graphs of segments
cites work: Integer realizations of disk and segment graphs
cites work: Extending convex partial drawings of graphs
cites work: Minimum-link paths among obstacles in the plane
cites work: Q3819622
cites work: Q3154374
cites work: ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
cites work: Complexity of Some Geometric and Topological Problems
cites work: Fixed points, Nash equilibria, and the existential theory of the reals
cites work: Q3138887
cites work: A linear time algorithm for minimum link paths inside a simple polygon
cites work: Convex Representations of Graphs
cites work: How to Draw a Graph
cites work: Q3102944
description: scientific article; zbMATH DE number 7023839