Partitions of planar sets into small triangles (Q1074866): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:05, 5 March 2024

scientific article
Language Label Description Also known as
English
Partitions of planar sets into small triangles
scientific article

    Statements

    Partitions of planar sets into small triangles (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    For a set P of 3n points in a convex planar body \(\Sigma\), a(n,P,\(\Sigma)\) is the smallest sum of areas of n triangles formed by the points P, such that the vertices of the triangles exhaust the 3n points of P and the triangles are pairwise disjoint. If a(n,\(\Sigma)\) denotes the supremum of a(n,P,\(\Sigma)\) over all \(P\subset \Sigma\) of 3n points, and a(n) denotes the supremum of a(n,\(\Sigma)\)/A(\(\Sigma)\) over all convex planar sets \(\Sigma\) with positive area A(\(\Sigma)\), then for \(n\geq 2\) the following is established \[ n^{-1/2}\ll a(n)\leq 0.8+O(n^{-1})\leq 0.9. \] Open problem: What is the limit of a(n) for \(n\to \infty ?\)
    0 references
    disjoint triangle partition
    0 references
    Heilbronn triangle problem
    0 references
    Ham
    0 references
    Sandwich theorem
    0 references
    convex planar body
    0 references

    Identifiers