Generalizations of Heilbronn's Triangle Problem
From MaRDI portal
Recommendations
- Generalizations of Heilbronn's triangle problem
- Heilbronn's triangle problem
- An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
- A lower bound for Heilbronn's triangle problem in d dimensions
- scientific article; zbMATH DE number 1305394
- Heilbronn triangle‐type problems in the unit square [0,1]2
- Generalized triangulations
- scientific article; zbMATH DE number 2107629
- scientific article; zbMATH DE number 4134934
- scientific article; zbMATH DE number 4175869
Cites work
- A Lower Bound for Heilbronn'S Problem
- A lower bound for Heilbronn's triangle problem in d dimensions
- Computing and Combinatorics
- Extremal uncrowded hypergraphs
- Lower Bounds on the Complexity of Polytope Range Searching
- On a Problem of Heilbronn†
- On Heilbronn's Triangle Problem
- On uncrowded hypergraphs
- The Algorithmic Aspects of Uncrowded Hypergraphs
Cited in
(6)- Generalizations of Heilbronn's triangle problem
- scientific article; zbMATH DE number 1305394 (Why is no real title available?)
- An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
- Distributions of Points and Large Convex Hulls of k Points
- Convex Hulls of Point-Sets and Non-uniform Hypergraphs
- On Heilbronn triangle-type problems in higher dimensions
This page was built for publication: Generalizations of Heilbronn's Triangle Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503518)