On the combinatorial classification of nondegenerate configurations in the plane
From MaRDI portal
Publication:1146677
DOI10.1016/0097-3165(80)90011-4zbMath0448.05016OpenAlexW2074065886MaRDI QIDQ1146677
Richard Pollack, Jacob E. Goodman
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(80)90011-4
Related Items
Drawing the Horton set in an integer grid of minimum size, More on k-sets of finite sets in the plane, Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\), Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements, The number of extreme pairs of finite point-sets in Euclidean spaces, Computing depth contours of bivariate point clouds, An infinite family of minor-minimal nonrealizable 3-chirotopes, Simultaneous dominance representation of multiple posets, Enumerating Neighborly Polytopes and Oriented Matroids, Ordering events in Minkowski space, Realization spaces of arrangements of convex bodies, Mechanical theorem proving in projective geometry, The Archimedean limit of random sorting networks, Allowable interval sequences and line transversals in the plane, When Can Splits be Drawn in the Plane?, The maximum number of halving lines and the rectilinear crossing number of for, A central approach to bound the number of crossings in a generalized configuration, Proof of a conjecture of Burr, Grünbaum, and Sloane, Complete enumeration of small realizable oriented matroids, The 3-symmetric pseudolinear crossing number of \(K_{36}\), Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines, Ham-sandwich cuts for abstract order types, On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\), Unnamed Item, Helly-type theorems for pseudoline arrangments in \(P^ 2\)., 2N noncollinear points determine at least 2N directions, The complexity of point configurations, A Representation Theorem for Generic Line Arrangements in the Plane, Some provably hard crossing number problems, Computing zonoid trimmed regions of bivariate data sets, Allowable interval sequences and separating convex sets in the plane, Geodesic order types, Suballowable sequences and geometric permutations, The combinatorial encoding of disjoint convex sets in the plane, An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\), Computing upward topological book embeddings of upward planar digraphs, Non-stretchable pseudo-visibility graphs, Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\), 3-symmetric and 3-decomposable geometric drawings of \(K_n\), A combinatorial version of Sylvester's four-point problem, Embeddability Problems for Upward Planar Digraphs, On the number of line separations of a finite set in the plane, On the number of k-subsets of a set of n points in the plane, On the number of directions determined by the common tangents to a family of pairwise disjoint convex sets in the plane, Semispaces of configurations, cell complexes of arrangements, Suballowable sequences of permutations, The number of small semispaces of a finite set of points in the plane, THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS, On the complexity of higher order abstract Voronoi diagrams
Cites Work
