Holes or empty pseudo-triangles in planar point sets
From MaRDI portal
Publication:1937360
Abstract: Let denote the smallest integer such that any set of at least points in the plane, no three on a line, contains either an empty convex polygon with vertices or an empty pseudo-triangle with vertices. The existence of for positive integers , is the consequence of a result proved by Valtr [Discrete and Computational Geometry, Vol. 37, 565--576, 2007]. In this paper, following a series of new results about the existence of empty pseudo-triangles in point sets with triangular convex hulls, we determine the exact values of and , and prove bounds on and , for . By dropping the emptiness condition, we define another related quantity , which is the smallest integer such that any set of at least points in the plane, no three on a line, contains a convex polygon with vertices or a pseudo-triangle with vertices. Extending a result of Bisztriczky and T'oth [Discrete Geometry, Marcel Dekker, 49--58, 2003], we obtain the exact values of and , and obtain non-trivial bounds on .
Recommendations
Cited in
(3)
This page was built for publication: Holes or empty pseudo-triangles in planar point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937360)