On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299): Difference between revisions

The authors present an algorithm to maintain the \(\mathcal{O}_\beta\)-hull of a planar point set while \(\beta\) runs from z to \(\pi\) and extend the result to solve related optimization problems. The values of \(\beta\) that maximize the area and the perimeter of \(\mathcal{O}_\beta H(P)\) are found. A variation of the 2-fitting problem is solved by fitting a two-joint not-necessarily orthogonal polygon chain to a point set.