11,194 research outputs found
Recommended from our members
Subquadratic nonobtuse triangulation of convex polygons
A convex polygon with n sides can be triangulated by O(n^1.85) triangles, without any obtuse angles. The construction uses a novel form of geometric divide and conquer
Maximal Area Triangles in a Convex Polygon
The widely known linear time algorithm for computing the maximum area
triangle in a convex polygon was found incorrect recently by Keikha et.
al.(arXiv:1705.11035). We present an alternative algorithm in this paper.
Comparing to the only previously known correct solution, ours is much simpler
and more efficient. More importantly, our new approach is powerful in solving
related problems
- …