scientific article
From MaRDI portal
Publication:3138746
zbMath0809.52026MaRDI QIDQ3138746
Richard Pollack, Jacob E. Goodman
Publication date: 11 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37)
Related Items
Enumeration of Gelfand-Cetlin type reduced words, Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\), On the number of directions determined by a three-dimensional points set, Better lower bounds on detecting affine and spherical degeneracies, Hamiltonicity and colorings of arrangement graphs, A Ramsey property of order types, The number of extreme triples of a planar point set, A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane, Minimal tangent visibility graphs, Illumination by floodlights, Enumerating topological \((n_k)\)-configurations, The Polyhedral Geometry of Pivot Rules and Monotone Paths, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, Approximating the Rectilinear Crossing Number, Ham-sandwich cuts for abstract order types, A farewell to Ricky Pollack, Higher-order Erdős-Szekeres theorems, Erdős-Szekeres theorem for point sets with forbidden subconfigurations, Suballowable sequences and geometric permutations, Decompositions, partitions, and coverings with convex polygons and pseudo-triangles, A pseudo-algorithmic separation of lines from pseudo-lines, Neighborly embedded manifolds, Recognizing Visibility Graphs of Triangulated Irregular Networks, Sweeps, arrangements and signotopes, Non-stretchable pseudo-visibility graphs, Graphs with Large Obstacle Numbers, Arrangements of pseudocircles: on circularizability, A positive fraction mutually avoiding sets theorem, Stabbing information of a simple polygon, Approximating the rectilinear crossing number, Subquadratic Encodings for Point Configurations, Helly-type problems
