Improved bounds for acute triangulations of convex polygons
نویسنده
چکیده
We present a novel method of constructing non-obtuse and acute triangulations of planar convex n-gons, improving existing bounds presented in [L. Yuan, Discrete Comput. Geom. 34, 697-706 (2005)] for 6 ≤ n ≤ 11 and 6 ≤ n ≤ 56, respectively.
منابع مشابه
On Minimal Triangulations of Products of Convex Polygons
We give new lower bounds for the minimal number of simplices needed in a triangulation of the product of two convex polygons, improving the lower bounds in [Bo&al05].
متن کاملOn Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملFlipping edge-labelled triangulations
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique labels to the triangulation edges. We introduce the concept of the orbit of an edge e, which is the set of all edges reachable from e via flips. We establish the...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملHow Many Potatoes Are in a Mesh?
We consider the combinatorial question of how many convex polygons can be made at most by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there can be exponentially many: Ω(1.5028) and O(1.62) in the worst case. If the triangulation is fat (every triangle has its angles lower-bounded by a constant δ > 0), then there can be only polynomially many: Ω(n ...
متن کامل