scientific article; zbMATH DE number 4182820

zbMATH Open0717.68042MaRDI QIDQ5748883FDOQ5748883

Authors: Jacob E. Goodman, Richard Pollack Edit this on Wikidata

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• The complexity of point configurations
• A note on order-type homogeneous point sets
• The Complexity of Order Type Isomorphism
• scientific article; zbMATH DE number 3931029

zbMATH Keywords

lower boundsnumber of combinatorial typesupper boundscounting polytopes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Cited In (8)

• New bounds for the same-type lemma
• Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• Ordering points by linear functionals
• An improved upper bound for the \(3\)-dimensional dimer problem
• Subquadratic encodings for point configurations
• Crossing numbers of random graphs
• A note on order-type homogeneous point sets

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 Q5748883)