Minimum-area enclosing triangle with a fixed angle (Q390370)

The paper is focused on the geomentric optimization problem of finding all the triangles of a minimum area with a fixed angle \(\omega\) enclosing a set of points in the plane. The processed set of points in the plane is represented by a convex \(n\)-gon. Vertices of this \(n\)-gon correspond to the vertices of the convex hull of the set of points. The presented algorithm is based on a so-called \(\omega\)-wedge introduction and an \(\omega\)-cloud determination. The \(\omega\)-wedge is defined as a closed set formed by the apex of \(\omega\), legs of \(\omega\) and the points between the legs. By rotating an \(\omega\)-wedge around the convex \(n\)-gon while continually touching this \(n\)-gon, the apex traces as a sequence of circular arcs, so-called \(\omega\)-clouds, are generated. Next, the minimum-area triangle enclosing the convex \(n\)-gon that can be constructed with a given \(\omega\)-wedge is computed and all possible \(\omega\)-wedges associated to the convex \(n\)-gon are considered. Finally, the minimum among all the computed triangles is determined.