scientific article; zbMATH DE number 431988
From MaRDI portal
Publication:3138746
zbMATH Open0809.52026MaRDI QIDQ3138746FDOQ3138746
Authors: Jacob E. Goodman, Richard Pollack 
Publication date: 11 November 1993
Title of this publication is not available (Why is that?)
Recommendations
- Suballowable sequences and geometric permutations
- Enumerating order types for small sets with applications
- Enumerating order types for small point sets with applications
- The complexity of point configurations
- Allowable double permutation sequences, arrangements of double pseudolines of Michel Pocchiola and their applications to planar families of convex sets
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)
Cited In (39)
- Neighborly embedded manifolds
- On the number of directions determined by a three-dimensional points set
- The number of extreme triples of a planar point set
- Enumeration of Gelfand-Cetlin type reduced words
- Recognizing Visibility Graphs of Triangulated Irregular Networks
- A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Arrangements of pseudocircles: on circularizability
- Approximating the rectilinear crossing number
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
- Enumerating topological \((n_k)\)-configurations
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Stabbing information of a simple polygon
- Non-stretchable pseudo-visibility graphs
- Underlying flag polymatroids
- Better lower bounds on detecting affine and spherical degeneracies
- Approximating the rectilinear crossing number
- An orderly algorithm and some applications in finite geometry
- Hamiltonicity and colorings of arrangement graphs
- Subquadratic encodings for point configurations
- Helly-type problems
- The Polyhedral Geometry of Pivot Rules and Monotone Paths
- Covering the edges of a complete geometric graph with convex polygons
- The Dirac-Goodman-Pollack conjecture
- Illumination by floodlights
- A Ramsey property of order types
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations
- Minimal tangent visibility graphs
- A positive fraction mutually avoiding sets theorem
- Sweeps, arrangements and signotopes
- Orientation of convex sets
- Allowable double permutation sequences, arrangements of double pseudolines of Michel Pocchiola and their applications to planar families of convex sets
- Enumerating order types for small sets with applications
- Higher-order Erdős-Szekeres theorems
- Graphs with large obstacle numbers
- Bounding and computing obstacle numbers of graphs
- Suballowable sequences and geometric permutations
- A farewell to Ricky Pollack
- A pseudo-algorithmic separation of lines from pseudo-lines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138746)
