On empty triangles determined by points in the plane
From MaRDI portal
Publication:1109343
DOI10.1007/BF01903339zbMath0655.52007MaRDI QIDQ1109343
Publication date: 1988
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Combinatorial inequalities (05A20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37)
Related Items
Drawing the Horton set in an integer grid of minimum size, On convex holes in d-dimensional point sets, The number of empty four-gons in random point sets, On empty convex polygons in a planar point set, Empty monochromatic triangles, Covering the convex quadrilaterals of point sets, On the number of halving planes, Point Selections and Weak ε-Nets for Convex Hulls, Carathéodory's theorem in depth, Holes and islands in random point sets, Tight bounds on the expected number of holes in random point sets, Chromatic variants of the Erdős--Szekeres theorem on points in convex position., Blocking the \(k\)-holes of point sets in the plane, Empty rainbow triangles in \(k\)-colored point sets, A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\), Empty monochromatic simplices, Hitting and Piercing Rectangles Induced by a Point Set, Witness (Delaunay) graphs, On almost empty monochromatic triangles and convex quadrilaterals in colored point sets, Witness rectangle graphs, On polygons enclosing point sets. II, STABBING SIMPLICES OF POINT SETS WITH k-FLATS, The Erdos-Szekeres problem on points in convex position – a survey, Empty triangles in good drawings of the complete graph
Cites Work
