Fetching the paper…
Reading the bibliography…
Order types are a well known abstraction of combinatorial properties of a point set.
Lattices with unique irreducible decompositions
Robert P. Dilworth · 1940
Earlier work this paper cites.
An algorithm for planning collision-free paths among polyhedral obstacles
Tomás Lozano-Pérez and Michael A. Wesley · 1979
Earlier work this paper cites.
On the combinatorial classification of nondegenerate configurations in the plane
Jacob E. Goodman and Richard Pollack · 1980
Earlier work this paper cites.
A theorem of ordered duality
Jacob E. Goodman and Richard Pollack · 1982
Earlier work this paper cites.
The theory of convex geometries
Paul H. Edelman and Robert E. Jamison · 1985
Earlier work this paper cites.
Some algebraic and geometric computations in PSPACE
John Canny · 1988
Earlier work this paper cites.
On recognizing and characterizing visibility graphs of simple polygons
Subir K. Ghosh · 1988
Earlier work this paper cites.
The universality theorems on the classification problem of configuration varieties and convex polytopes varieties
Nicolai E. Mnëv · 1988
Earlier work this paper cites.
An algorithmic characterization of antimatroids
E. Andrew Boyd and Ulrich Faigle · 1990
Earlier work this paper cites.
Visibility graph recognition
Hazel Everett · 1990
Earlier work this paper cites.
Recognizing visibility graphs of spiral polygons
Hazel Everett and Derek G. Corneil · 1990
Earlier work this paper cites.
Some provably hard crossing number problems
Daniel Bienstock · 1991
Earlier work this paper cites.
Greedoids
Bernhard Korte, László Lovász, and Rainer Schrader · 1991
Earlier work this paper cites.
Stretchability of pseudolines is NP-hard
Peter W. Shor · 1991
Earlier work this paper cites.
Axioms and Hulls
Donald E. Knuth · 1992
Earlier work this paper cites.
Allowable sequences and order types in discrete and computational geometry
Jacob E. Goodman and Richard Pollack · 1993
Earlier work this paper cites.
Intersection graphs of segments
Jan Kratochvíl and Jiří Matoušek · 1994
Cited alongside, same era.
Visibility graphs of polygonal rings
Leizhen Cai and Hazel Everett · 1995
Cited alongside, same era.
Realization spaces of 4-polytopes are universal
Jürgen Richter-Gebert and Günter M. Ziegler · 1995
Cited alongside, same era.
Visibility graphs of towers
Paul Colley, Anna Lubiw, and Jeremy Spinrad · 1997
Cited alongside, same era.
On recognizing and characterizing visibility graphs of simple polygons
Subir K. Ghosh · 1997
Cited alongside, same era.
Vertex-edge pseudo-visibility graphs: Characterization and recognition
Joseph O’Rourke and Ileana Streinu · 1997
Cited alongside, same era.
Oriented Matroids
Finite convex geometries of circles
Gábor Czédli · 2014
Later among the works it cites.
Intersection graphs of segments and ∃ ℝ \exists\mathbb{R}
Jiří Matoušek · 2014
Later among the works it cites.
On the complexity of problems on order types and geometric graphs
Alexander Pilz · 2014
Later among the works it cites.
Universality theorems for inscribed polytopes and Delaunay triangulations
Karim A. Adiprasito, Arnau Padrol, and Louis Theran · 2015
Later among the works it cites.
Computational geometry column 62
Jean Cardinal · 2015
Later among the works it cites.
A characterization of visibility graphs for pseudo-polygons
Matt Gibson, Erik Krohn, and Qing Wang · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Anders Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Günter M. Ziegler · 1999
Cited alongside, same era.
Choice functions and abstract convex geometries
Gleb A. Koshevoy · 1999
Cited alongside, same era.
Visibility graphs and oriented matroids
James Abello and Krishna Kumar · 2002
Cited alongside, same era.
The affine representation theorem for abstract convex geometries
Kenji Kashiwabara, Masataka Nakamura, and Yoshio Okamoto · 2005
Cited alongside, same era.
Non-stretchable pseudo-visibility graphs
Ileana Streinu · 2005
Cited alongside, same era.
Complexity of some geometric and topological problems
Marcus Schaefer · 2009
Cited alongside, same era.
Embedding convex geometries and a bound on convex dimension
Michael Richter and Luke G. Rogers · 2015
Later among the works it cites.
Representation of convex geometries by circles in the plane
Kira Adaricheva and Madina Bolat · 2016
Later among the works it cites.
Visibility graphs of anchor polygons
Hossein Boomari and Alireza Zarei · 2016
Later among the works it cites.
Recognition and complexity of point visibility graphs
Jean Cardinal and Udo Hoffmann · 2016
Later among the works it cites.
Obstructing Visibilities with One Obstacle
Steven Chaplick, Fabian Lipp, Ji-won Park, and Alexander Wolff · 2016
Later among the works it cites.
Representing convex geometries by almost-circles
Gábor Czédli and János Kincses · 2016
Later among the works it cites.
Intersection Graphs and Geometric Objects in the Plane
Udo Hoffmann · 2016
Later among the works it cites.
The art gallery problem is ∃ ℝ \exists\mathbb{R} -complete
Mikkel Abrahamsen, Anna Adamaszek, and Tillmann Miltzow · 2017
Later among the works it cites.
On the complexity of the planar slope number problem
Udo Hoffmann · 2017
Later among the works it cites.