The complexity of drawing a graph in a polygonal region
From MaRDI portal
Publication:5050006
Recommendations
Cites work
- scientific article; zbMATH DE number 6707504 (Why is no real title available?)
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 4092241 (Why is no real title available?)
- scientific article; zbMATH DE number 3518931 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A Kuratowski-type theorem for planarity of partially embedded graphs
- A linear time algorithm for minimum link paths inside a simple polygon
- Complexity of geometric \(k\)-planarity for fixed \(k\)
- Complexity of some geometric and topological problems
- Convex Representations of Graphs
- Convex drawings of graphs with non-convex boundary constraints
- Discrete one-forms on meshes and applications to 3D mesh parameterization
- Drawing graphs in the plane with a prescribed outer face and polynomial area
- Drawing graphs on few lines and few planes
- Drawing partially embedded and simultaneously planar graphs
- Extending convex partial drawings of graphs
- Fixed points, Nash equilibria, and the existential theory of the reals
- Graph Drawing
- How to Draw a Graph
- Integer realizations of disk and segment graphs
- Intersection graphs of segments
- Irrational guards are sometimes needed
- Minimum-link paths among obstacles in the plane
- Minimum-link watchman tours
- Mnëv's universality theorem revisited
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
- On the complexity of some geometric problems with fixed parameters
- On the complexity of the planar slope number problem
- Picking planar edges; or, drawing a graph with a planar subgraph
- Simple realizability of complete abstract topological graphs simplified
- Some provably hard crossing number problems
- Sphere and dot product representations of graphs
- Testing Planarity of Partially Embedded Graphs
- The Art Gallery Problem is ∃ℝ-complete
- The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
- The complexity of drawing a graph in a polygonal region
- The complexity of simultaneous geometric graph embedding
- Thirty Essays on Geometric Graph Theory
- Variants of the segment number of a graph
- Who needs crossings? Hardness of plane graph rigidity
Cited in
(10)- The complexity of drawing graphs on few lines and few planes
- The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
- \(\forall\exists\mathbb {R}\)-completeness and area-universality
- The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- The complexity of drawing a graph in a polygonal region
- The complexity of the Hausdorff distance
- On the complexity of some geometric problems with fixed parameters
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
- On classifying continuous constraint satisfaction problems
This page was built for publication: The complexity of drawing a graph in a polygonal region
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050006)
