منابع مشابه
Algorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملMaximal Area Triangles in a Convex Polygon
In [12], the widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect, and whether it can still be solved in linear time was proposed as an open problem. We resolved it affirmatively by presenting a new linear time algorithm. Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles. 1998 ACM Subjec...
متن کاملLargest Subsets of Triangles in a Triangulation
Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) is convex, (ii) is monotone, (iii) has a bounded total angular change, or (iv) has a bounded negative turning angle. The first, second, and fourth problems are solved in polynomial time, the third problem is NP-hard.
متن کاملOn Isosceles Triangles and Related Problems in a Convex Polygon
Given any convex n-gon, in this article, we: (i) prove that its vertices can form at most n2/2 + Θ(n log n) isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture that its vertices can form at most 3n2/4 + o(n2) isosceles triangles and prove this conjecture for a special group of convex n-gons, (iii) prove that its vertices can f...
متن کاملFinding the Largest Area Axis-parallel Rectangle in a Polygon
This paper considers the geometric optimization problem of nding the Largest area axis-parallel Rectangle (LR) in an n-vertex general polygon. We characterize the LR for general polygons by considering diierent cases based on the types of contacts between the rectangle and the polygon. A general framework is presented for solving a key subproblem of the LR problem which dominates the running ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2021
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2021.101792