On Heilbronn triangle-type problems in higher dimensions
From MaRDI portal
Publication:6621159
Authors: F. S. Benevides, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Recommendations
Geometric probability and stochastic geometry (60D05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)
Cites Work
- A Lower Bound for Heilbronn'S Problem
- A lower bound for Heilbronn's triangle problem in \(d\) dimensions
- An Algorithm for Heilbronn's Problem
- Developments in Heilbronn's triangle problem
- Distributions of points in \(d\) dimensions and large \(k\) -point simplices
- Distributions of points in the unit square and large \(k\)-gons
- Lower Bounds on the Complexity of Polytope Range Searching
- Maximizing the Smallest Triangle Made by N Points in a Square
- New lower bounds for Heilbronn numbers
- New versions of Suen's correlation inequality
- On Heilbronn's Triangle Problem
- On a Problem of Heilbronn†
- On smallest triangles
- On the Heilbronn Optimal Configuration of Seven Points in the Square
- The average‐case area of Heilbronn‐type triangles*
Cited In (2)
This page was built for publication: On Heilbronn triangle-type problems in higher dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621159)