Fetching the paper…
Reading the bibliography…
It is well known that any graph admits a crossing-free straight-line drawing in $\mathbb{R}^3$ and that any planar graph admits the same even in $\mathbb{R}^2$.
Line and plane cover numbers revisited
T. Biedl, S. Felsner, and A. Wolff · 1908
Earlier work this paper cites.
Representing graphs and hypergraphs by touching polygons in 3D
W. Evans, P. Rzążewski, N. Saeedi, C.-S. Shin, and A. Wolff · 1908
Earlier work this paper cites.
Variants of the segment number of a graph
Y. Okamoto, A. Ravsky, and A. Wolff · 1908
Earlier work this paper cites.
On manifolds of combinatorial types of projective configurations and convex polyhedra
N. E. Mnëv · 1985
Earlier work this paper cites.
Some algebraic and geometric computations in PSPACE
J. F. Canny · 1988
Earlier work this paper cites.
The universality theorems on the classification problem of configuration varieties and convex polytopes varieties
N. E. Mnëv · 1988
Earlier work this paper cites.
Bounds for the vertex linear arboricity
M. Matsumoto · 1990
Earlier work this paper cites.
Some provably hard crossing number problems
D. Bienstock · 1991
Earlier work this paper cites.
Noncrossing subgraphs in topological layouts
J. Kratochvíl, A. Lubiw, and J. Nešetřil · 1991
Earlier work this paper cites.
Stretchability of pseudolines is NP-hard
P. W. Shor · 1991
Earlier work this paper cites.
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
J. Renegar · 1992
Earlier work this paper cites.
On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination
J. Renegar · 1992
Earlier work this paper cites.
On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
J. Renegar · 1992
Earlier work this paper cites.
Graphics gems
A. S. Glassner, editor · 1993
Earlier work this paper cites.
Intersection graphs of segments
J. Kratochvíl and J. Matoušek · 1994
Cited alongside, same era.
Properties of arrangement graphs
P. Bose, H. Everett, and S. K. Wismath · 2003
Cited alongside, same era.
Track layouts of graphs
V. Dujmović, A. Pór, and D. R. Wood · 2004
Cited alongside, same era.
Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
A. Farrugia · 2004
Cited alongside, same era.
Drawings of planar graphs with few slopes and segments
V. Dujmović, D. Eppstein, M. Suderman, and D. R. Wood · 2006
Cited alongside, same era.
Linear degree extractors and the inapproximability of max clique and chromatic number
D. Zuckerman · 2007
Cited alongside, same era.
Intersection graphs of segments and ∃ ℝ \exists\mathbb{R}
J. Matoušek · 2014
Later among the works it cites.
Computational geometry column 62
J. Cardinal · 2015
Later among the works it cites.
Drawing graphs with few arcs
A. Schulz · 2015
Later among the works it cites.
Recognition and complexity of point visibility graphs
J. Cardinal and U. Hoffmann · 2017
Closest in time.
The complexity of drawing graphs on few lines and few planes
S. Chaplick, K. Fleszar, F. Lipp, A. Ravsky, O. Verbitsky, and A. Wolff · 2017
Closest in time.
On the complexity of the planar slope number problem
U. Hoffmann · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
W. Mulzer and G. Rote · 2008
Cited alongside, same era.
Geometry Revealed: A Jacob’s Ladder to Modern Higher Geometry
M. Berger · 2010
Cited alongside, same era.
Complexity of some geometric and topological problems
M. Schaefer · 2010
Cited alongside, same era.
Hardness of embedding simplicial complexes in ℝ d \mathbb{R}^{d}
J. Matoušek, M. Tancer, and U. Wagner · 2011
Cited alongside, same era.
Sphere and dot product representations of graphs
R. J. Kang and T. Müller · 2012
Cited alongside, same era.
Three-dimensional drawings
V. Dujmović and S. Whitesides · 2013
Cited alongside, same era.
Fixed points, Nash equilibria, and the existential theory of the reals
M. Schaefer and D. Štefankovič · 2017
Closest in time.
Examining weak line covers with two lines in the plane
O. Firman, F. Lipp, L. Straube, and A. Wolff · 2018
Closest in time.
Embeddability in the 3-sphere is decidable
J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner · 2018
Closest in time.
Planar 3-SAT with a clause/variable cycle
A. Pilz · 2019
Closest in time.
Drawing graphs on few lines and few planes
S. Chaplick, K. Fleszar, F. Lipp, A. Ravsky, O. Verbitsky, and A. Wolff · 2020
Closest in time.
Geometric embeddability of complexes is ∃ ℝ \exists\mathbb{R} -complete
M. Abrahamsen, L. Kleist, and T. Miltzow · 2021
Closest in time.
Adjacency graphs of polyhedral surfaces
E. Arseneva, L. Kleist, B. Klemz, M. Löffler, A. Schulz, B. Vogtenhuber, and A. Wolff · 2021
Closest in time.
The weak line cover number in 3D for restricted graph classes
A. Erhardt · 2021
Closest in time.