An acute triangulation of a polygon \u393 is a triangulation of \u393 into acute triangles. Let f (\u393 ) denote the minimum number of triangles necessary for an acute triangulation of \u393 . We prove that the maximum value of f (Q) for all convex quadrilaterals Q is equal to 8. This solves a problem raised by Maehara (2001) in [4]
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and Mi...
AbstractLet Σ be a polyhedral surface in R3 with n edges. Let L be the length of the longest edge in...
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maxim...
An acute triangulation of a polygon \u393 is a triangulation of \u393 into acute triangles. Let f (\...
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute tri...
An acute triangulation of a polygon is a triangulation whose triangles have all their angles less th...
We present a novel method of constructing non-obtuse and acute triangulations of planar convex n-gon...
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute tri...
We present a novel method of constructing non-obtuse and acute triangulations of planar convex n-gon...
AbstractIn this paper, we show that every maximal plane graph with minimum degree at least 4 and m f...
AbstractIn this paper we discuss acute triangulations of trapezoids. It is known that every rectangl...
AbstractWe prove that every n -gon can be triangulated into O(n) acute triangles. We also present a ...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
We consider the combinatorial question of how many convex polygons can be made by using the edges ta...
AbstractFor a given planar point set P, consider a partition of P into disjoint convex polygons. In ...
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and Mi...
AbstractLet Σ be a polyhedral surface in R3 with n edges. Let L be the length of the longest edge in...
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maxim...
An acute triangulation of a polygon \u393 is a triangulation of \u393 into acute triangles. Let f (\...
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute tri...
An acute triangulation of a polygon is a triangulation whose triangles have all their angles less th...
We present a novel method of constructing non-obtuse and acute triangulations of planar convex n-gon...
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute tri...
We present a novel method of constructing non-obtuse and acute triangulations of planar convex n-gon...
AbstractIn this paper, we show that every maximal plane graph with minimum degree at least 4 and m f...
AbstractIn this paper we discuss acute triangulations of trapezoids. It is known that every rectangl...
AbstractWe prove that every n -gon can be triangulated into O(n) acute triangles. We also present a ...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
We consider the combinatorial question of how many convex polygons can be made by using the edges ta...
AbstractFor a given planar point set P, consider a partition of P into disjoint convex polygons. In ...
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and Mi...
AbstractLet Σ be a polyhedral surface in R3 with n edges. Let L be the length of the longest edge in...
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maxim...
DOI
Add to ORKG