On an empty triangle with the maximum area in planar point sets

DOI10.1016/J.DISC.2011.05.006MaRDI QIDQ2275445zbMATH OpenOpenAlexFDO

Authors Kiyoshi Hosono

Publication date 9 August 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.05.006

zbMATH Keywords

5-holes with disjoint interiorsarea of an empty triangleempty convex polygons

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Review text

For any given set \(P\) of \(n\) points in general position in the plane, let \(T\subset P\) be a subset of three elements in convex position. The triangle \(\mathrm{conv}\,T\) is said to be \textit{empty} if no point of \(P\) lies inside \(\mathrm{conv}\,T\). The author studies the ratio between the maximum area of an empty triangle and the area of \(\mathrm{conv}P\), i.e., the function \( f(n)=\min_{\#P=n}\max_{T\subset P} A(\mathrm{conv}\,T)/A(\mathrm{conv}P)\). In the previous paper [Lect. Notes Comput. Sci. 3330, 102--107 (2005; Zbl 1117.52009)], the author et al. obtained upper and lower bounds for \(f(n)\) when \(n\geq 25\), namely \(23/\bigl((37+3\sqrt{5})n+c\bigr)\leq f(n)\leq 1/(n-1)\) for a certain constant \(c\). In this paper, the author improves slightly the lower bound to \(15/\bigl((24+2\sqrt{5})n+c\bigr)\) for \(n\geq 17\).

Recommendations

• Combinatorial Geometry and Graph Theory
• More on the maximum area polygons in a planar point set
• Triangles of extremal area or perimeter in a finite planar point set
• On edge-disjoint empty triangles of point sets
• On empty triangles determined by points in the plane

Cites work

• Combinatorial Geometry and Graph Theory
• Empty convex hexagons in planar point sets
• Konvexe Fünfecke in ebenen Punktmengen
• Simultaneous inner and outer approximation of shapes

Cited in

(11)

• On the maximum area pentagon in a planar point set
• On empty triangles determined by points in the plane
• Extremal properties for triangulation based on empty convex set condition
• On edge-disjoint empty triangles of point sets
• More on the maximum area polygons in a planar point set
• A note on the number of empty triangles
• The maximum number of empty congruent triangles determined by a point set
• Combinatorial Geometry and Graph Theory
• Triangles of extremal area or perimeter in a finite planar point set
• Distinct triangle areas in a planar point set over finite fields
• On maximum area polygons in a planar point set

This page was built for publication: On an empty triangle with the maximum area in planar point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275445)