An Algorithm for Heilbronn's Problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2086227
- A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
- Publication:4952600
- Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points
- Point sets in the unit square and large areas of convex hulls of subsets of points
Cited in
(20)- Point sets in the unit square and large areas of convex hulls of subsets of points
- Generalizations of Heilbronn's triangle problem
- Heuristics and exact algorithms for solving the Monden problem
- Determining the Heilbronn configuration of seven points in triangles via symbolic computation
- Two geometrical applications of the semi-random method
- Distributions of points in the unit square and large \(k\)-gons
- scientific article; zbMATH DE number 2086227 (Why is no real title available?)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points
- The average‐case area of Heilbronn‐type triangles*
- A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
- Algorithms and Computation
- New lower bounds for Heilbronn numbers
- Heilbronn triangle‐type problems in the unit square [0,1]2
- Heilbronn's problem of eight points in the square
- Efficient algorithms for Battleship
- Upper bounds for Heilbronn's triangle problem in higher dimensions
- On Heilbronn triangle-type problems in higher dimensions
- Large triangles in the \(d\)-dimensional unit cube
- Distributions of points in \(d\) dimensions and large \(k\) -point simplices
This page was built for publication: An Algorithm for Heilbronn's Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507356)
